Items where Research Area is "Theory and Applications of Algorithms" and Year is 2019

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators | Category | No Grouping
Jump to: A | B | C | D | F | G | H | K | L | N | P | S
Number of items: 33.

A

  • Algorithms and Hardness for Diameter in Dynamic Graphs
    Ancona, Bertie and Henzinger, Monika and Roditty, Liam and Vassilevska Williams, Virginia and Wein, Nicole In: 46th International Colloquium on Automata, Languages and Programming (ICALP 2019) , 8-12 July 2019 , Patras, Greece (2019)

    • B

  • Finding Optimal Longest Paths by Dynamic Programming in Parallel
    Balyo, Tomas and Fieger, Kai and Schreiber, Dominik and Schulz, Christian In: Twelfth Annual Symposium on Combinatorial Search (SoCS'19) , July 16, 2019 – July 17, 2019 , Napa, California (2019)

  • A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
    Bernstein, Aaron and Forster, Sebastian and Henzinger, Monika In: ACM-SIAM Symposium on Discrete Algorithms (SODA19) , January 6-9, 2019 , San Diego, California, USA (2019)

  • Deterministic Dynamic Matching in O(1) Update Time
    Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika ISSN 1432-0541 (2019)

  • A New Deterministic Algorithm for Dynamic Set Cover
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon In: 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019) , November 9-12, 2019 , Baltimore, Maryland, USA (2019)

  • New amortized cell-probe lower bounds for dynamic problems
    Bhattacharya, Sayan and Henzinger, Monika and Neumann, Stefan ISSN 0304-3975 (2019)

  • Vienna Graph Clustering
    Biedermann, Sonja and Henzinger, Monika and Schulz, Christian and Schuster, Bernhard In: Protein-Protein Interaction Networks. Methods in Molecular Biology. Humana, New York, NY (2019)

    • C

  • Maximin-Aware Allocations of Indivisible Goods
    Chan, Hau and Chen, Jing and Li, Bo and Wu, Xiaowei In: IJCAI 2019, 28th International Joint Conference on Artificial Intelligence , August 10-16, 2019 , Macao, China (2019)

  • Near-linear time algorithms for Streett objectives in Graphs and MDPs
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Svozil, Alexander In: CONCUR 2019, the 30th International Conference on Concurrency Theory , August 26-31, 2019 , Amsterdam, The Netherlands (2019)

    • D

  • Distributed edge connectivity in sublinear time.
    Daga, Mohit and Henzinger, Monika and Nanongkai, Danupon and Saranurak, Thatchaphol In: 51st Annual ACM Symposium on the Theory of Computing , June 23-26, 2019 , Phoenix, AZ, USA (2019)

  • Fully dynamic specrtal vertex sparsifiers and applications
    Durfee, David and Gao, Yu and Goranci, Gramoz and Peng, Richard In: 51st Annual ACM Symposium on the Theory of Computing (STOC 2019) , 23-26 June 2019 , Phoenix, AZ, USA (2019)

    • F

  • Dynamic low-stretch trees via dynamic low-diameter decompositions
    Forster, Sebastian and Goranci, Gramoz In: 51st Annual ACM Symposium on the Theory of Computing (STOC 2019) , 23-26 June 2019 , Phoenix, AZ, USA (2019)

  • Communication-free massively distributed graph generation
    Funke, Daniel and Lamm, Sebastian and Meyer, Ulrich and Sanders, Peter and Schulz, Christian and Strash, Darren and von Looz, Moritz ISSN 0743-7315 (2019)

    • G

  • Improved Guarantees for Vertex Sparsification in Planar Graphs
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan ISSN 0895-4801 (2019)

    • H

  • Strategyproof and Approximately Maxmin Fair Share Allocation of Chores
    Haris, Aziz and Li, Bo and Wu, Xiaowei In: IJCAI 2019, 28th International Joint Conference on Artificial Intelligence , August 10-16, 2019 , Macao, China (2019)

  • Efficient Distributed Workload (Re-)Embedding
    Henzinger, Monika and Neumann, Stefan and Schmid, Stefan ISSN 2476-1249 (2019)

  • Efficient Distributed Workload (Re-)Embedding
    Henzinger, Monika and Neumann, Stefan and Schmid, Stefan In: ACM SIGMETRICS / IFIP Performance 2019 , June 2019 , Phoenix, Arizona, USA (2019)

  • Shared-memory Exact Minimum Cuts
    Henzinger, Monika and Noe, Alexander and Schulz, Christian In: 33rd IEEE International Parallel & Distributed Processing Symposium , 20-24.5.2019 , Rio de Janeiro (2019)

  • Local Flow Partitioning for Faster Edge Connectivity
    Henzinger, Monika and Rao, Satish and Wang, Di ISSN 0097-5397 (2019)

  • Scalable Kernelization for Maximum Independent Sets
    Hespe, Demian and Schulz, Christian and Strash, Darren ISSN 1084-6654 (2019)

  • Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
    Huang, Zhiyi and Peng, Binghui and Tang, Zhihao Gavin and Tao, Runzhou and Wu, Xiaowei and Zhang, Yuhao In: SODA 2019, 30th Annual ACM-SIAM Symposium on Discrete Algorithms , Jan 6-9, 2019 , San Diego, California, USA (2019)

  • Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
    Huang, Zhiyi and Tang, Zhihao Gavin and Wu, Xiaowei and Zhang, Yuhao ISSN 1549-6325 (2019)

    • K

  • Depth First Search in the Semi-streaming Model
    Khan, Shahbaz and Mehta, Shashank K In: Symposium on Theoretical Aspects of Computer Science (STACS2019) , March 13-16, 2019 , Berlin, Deutschland (2019)

    • L

  • Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
    Lamm, Sebastian and Schulz, Christian and Strash, Darren and Williger, Robert and Zhang, Huashuo In: 21st Workshop on Algorithm Engineering and Experiments (ALENEX19) , Jan 7-8, 2019 , San Diego, California, USA (2019)

  • Well-behaved Online Load Balancing Against Strategic Jobs
    Li, Bo and Li, Minming and Wu, Xiaowei In: AAMAS 2019, 18th International Conference on Autonomous Agents and Multiagent Systems , May 13-17, 2019 , Montreal, QC, Canada (2019)

  • MPR - A Partitioning-Replication Framework for Multi-Processing kNN Search on Road Networks
    Luo, Siqiang and Kao, Ben and Wu, Xiaowei and Cheng, Reynold In: 35th IEEE International Conference on Data Engineering (ICDE 2019) , 8-11 April 2019 , Macao, China (2019)

    • N

  • Finding Tiny Clusters in Bipartite Graphs
    Neumann, Stefan In: INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft , 23.-26.09.2019 , Kassel, Deutschland (2019)

    • P

  • How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures
    Pachajoa, Carlos and Levonyak, Markus and Gansterer, Wilfried and Träff, Jesper Larsson In: 48th International Conference on Parallel Processing (ICPP 2019) , 05-08 Aug 2019 , Kyoto, Japan (2019)

  • Node-Failure-Resistant Preconditioned Conjugate Gradient Method without Replacement Nodes
    Pachajoa, Carlos and Pacher, Christina and Gansterer, Wilfried In: 2019 IEEE/ACM 9th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS) , 22 Nov. 2019 , Denver. CO. USA (2019)

  • Fault-tolerant least squares solvers for wireless sensor networks based on gossiping
    Prikopa, Karl E. and Gansterer, Wilfried ISSN 0743-7315 (2019)

    • S

  • Faster Support Vector Machines
    Schag, Stefan and Schmitt, Matthias and Schulz, Christian In: Twenty-First Workshop on Algorithm Engineering and Experiments, (ALENEX 2019) , Jan 7-8, 2019 , San Diego, California, USA (2019)

  • Scalable Edge Partitioning
    Schlag, Sebastian and Schulz, Christian and Seemaier, Daniel and Strash, Darren In: Twenty-First Workshop on Algorithm Engineering and Experiments, (ALENEX 2019) , Jan 7-8, 2019 , San Diego, California, USA (2019)

  • Graph Partitioning: Formulations and Applications to Big Data
    Schulz, Christian and Strash, Darren In: Encyclopedia on Big Data Technologies. Springer (2019)

    • This list was generated on Sat Nov 9 19:22:47 2024 CET.
    Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
    EPrints Logo
    CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.