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

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators | Category | No Grouping
Jump to: Journal Paper | Paper in Conference Proceedings or in Workshop Proceedings
Number of items: 28.

Journal Paper

  • Welfare Maximization with Friends-of-Friends Network Externalities
    Bhattacharya, Sayan and Dvořák, Wolfgang and Henzinger, Monika and Starnberger, Martin Theory of Computing Systems. pp. 1-39 ISSN 1432-4350 Springer US (2017)

  • Improved Algorithms for Parity and Streett objectives
    Chatterjee, Krishnendu and Henzinger, Monika and Loitzenbauer, Veronika ISSN 1860-5974 (2017)

  • Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon ISSN 1549-6325 (2017)

  • Finding near-optimal independent sets at scale
    Lamm, Sebastian and Sanders, Peter and Schulz, Christian and Strash, Darren and Werneck, Renato F. J. Heuristics, 23 (4). pp. 207-229 ISSN 1381-1231 (2017)

  • Drawing Large Graphs by Multilevel Maxent-Stress Optimization
    Meyerhenke, Henning and Nöllenburg, Martin and Schulz, Christian ISSN 1077-2626 (2017)

  • Parallel Graph Partitioning for Complex Networks
    Meyerhenke, Henning and Sanders, Peter and Schulz, Christian IEEE Trans. Parallel Distrib. Syst., 28 (9). pp. 2625-2638 ISSN 1045-9219 (2017)

  • Fault tolerant communication-optimal 2.5D matrix multiplication
    Moldaschl, Michael and Prikopa, Karl E. and Gansterer, Wilfried pp. 179-190 ISSN 0743-7315 (2017)

    • Paper in Conference Proceedings or in Workshop Proceedings

  • Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
    Becker, Ruben and Karrenbauer, Andreas and Krinninger, Sebastian and Lenzen, Christoph In: 31st International Symposium on Distributed Computing (DISC 2017) , October 17–19, 2017 , Vienna (2017)

  • Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
    Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika In: 19th Conference on Integer Programming and Combinatorial Optimization , June 26 - 28, 2017 , Waterloo, Canada (2017)

  • Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log^3 n) Worst Case Update Time
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 2017 , January 16-19, 2017 , Barcelona, Spain (2017)

  • Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs
    Bringmann, Karl and Hansen, Thomas Dueholm and Krinninger, Sebastian In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) , July 10–14 2017 , Warsaw (2017)

  • Brief Announcement: A Note on Hardness of Diameter Approximation
    Bringmann, Karl and Krinninger, Sebastian In: 31st International Symposium on Distributed Computing (DISC 2017) , October 17–19, 2017 , Vienna (2017)

  • Improved Set-Based Symbolic Algorithms for Parity Games
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: 26th EACSL Annual Conference on Computer Science Logic, CSL 2017, August 20-24, 2017, Stockholm, Sweden , 20-24 August 2017 , Stockholm (2017)

  • Faster Algorithms for Mean-Payoff Parity Games
    Chatterjee, Krishnendu and Henzinger, Monika and Svozil, Alexander In: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS) 2017 , 21-25 August 2017 , Aalborg, Denmark (2017)

  • Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
    Chechik, Shiri and Hansen, Thomas Dueholm and Italiano, Giuseppe F. and Loitzenbauer, Veronika and Parotsidis, Nikos In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) , 16-19 Jan 2017 , Barcelona, Spain (2017)

  • Decremental Data Structures for Connectivity and Dominators in Directed Graphs
    Georgiadis, Loukas and Hansen, Thomas Dueholm and Italiano, Giuseppe F. and Krinninger, Sebastian and Parotsidis, Nikos In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) , July 10–14 2017 , Warsaw (2017)

  • Improved Guarantees for Vertex Sparsification in Planar Graphs
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan In: 25th Annual European Symposium on Algorithms (ESA 2017) , September 4-6, 2017 , Vienna, Austria (2017)

  • The Power of Vertex Sparsifiers in Dynamic Graph Algorithms
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan In: 25th Annual European Symposium on Algorithms (ESA 2017) , September 4-6, 2017 , Vienna, Austria (2017)

  • Dynamic Clustering to Minimize the Sum of Radii
    Henzinger, Monika and Leniowski, Dariusz and Mathieu, Claire In: 25th Annual European Symposium on Algorithms , 4-6 Sep 2017 , Vienna, Austria (2017)

  • Conditional Hardness for Sensitivity Problems
    Henzinger, Monika and Lincoln, Andrea and Neumann, Stefan and Vassilevska Williams, Virginia In: 8th Innovations in Theoretical Computer Science (ITCS) 2017 , 9-11 Jan 2017 , Berkeley, California, United States of America (2017)

  • Local Flow Partitioning for Faster Edge Connectivity
    Henzinger, Monika and Rao, Satish and Wang, Di In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 2017 , January 16-19, 2017 , Barcelona, Spain (2017)

  • Testable Bounded Degree Graph Properties Are Random Order Streamable
    Monemizadeh, Morteza and Muthukrishnan, S. and Peng, Pan and Sohler, Christian In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland , July 10-14 2017 , Warsaw (2017)

  • Graph Partitioning with Acyclicity Constraints
    Moreira, Orlando and Popp, Merten and Schulz, Christian In: 16th Symposium on Experimental Algorithms (SEA) 2017 , June 21–23, 2017 , London, UK (2017)

  • Reductions for Frequency-Based Data Mining Problems
    Neumann, Stefan and Miettinen, Pauli In: 17th IEEE International Conference on Data Mining 2017 (ICDM'17) , 18-21 Nov 2017 , New Orleans (2017)

  • On the Resilience of Conjugate Gradient and Multigrid Methods to Node Failures
    Pachajoa, Carlos and Gansterer, Wilfried In: Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28 - September 1, 2017, Proceedings , August 28 - September 1 , Santiago de Compostela, Spain (2017)

  • Distributed evolutionary k-way node separators
    Sanders, Peter and Schulz, Christian and Strash, Darren and Williger, Robert In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017 , July 15-19 2017 , Berlin, Germany (2017)

  • Better Process Mapping and Sparse Quadratic Assignment Problems
    Schulz, Christian and Träff, Jesper Larsson In: 16th Symposium on Experimental Algorithms (SEA) 2017 , June 21–23, 2017 , London, UK (2017)

  • Capacity Releasing Diffusion for Speed and Locality
    Wang, Di and Fountoulakis, Kimon and Henzinger, Monika and Mahoney, Michael W. and Rao, Satish In: Thirty-fourth International Conference on Machine Learning 2017 , 06-11 Aug 2017 , Sydney, Australia (2017)

    • This list was generated on Sun Nov 24 01:07:10 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.