Items where Subject is "Theoretische Informatik"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
  • Subjects (195)
    • Theoretische Informatik (195)
Group by: Creators | Category
Jump to: Journal Paper | Paper in Conference Proceedings or in Workshop Proceedings | Book Section/Chapter | Technical Report
Number of items at this level: 195.

Journal Paper

  • On rejected arguments and implicit conflicts: The hidden power of argumentation semantics
    Baumann, Ringo and Dvořák, Wolfgang and Linsbichler, Thomas and Spanring, Christof and Strass, Hannes and Woltran, Stefan Artificial Intelligence , 241. 244 - 284 ISSN 0004-3702 (2016)

  • 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)

  • Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
    Bhattacharya, Sayan and Henzinger, Monika and Italiano, Giuseppe F. ISSN 0097-5397 (2018)

  • Dynamic algorithms via the primal-dual method
    Bhattacharya, Sayan and Henzinger, Monika and Italiano, Giuseppe F. ISSN 0890-5401 (2018)

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

  • Wireless Evacuation on m Rays with k Searchers
    Brandt, Sebastian and Foerster, Klaus-Tycho and Richner, Benjamin and Wattenhofer, Roger ISSN 0304-3975 (2018)

  • Augmenting Flows for the Consistent Migration of Multi-Commodity Single-Destination Flows in SDNs
    Brandt, Sebastian and Foerster, Klaus-Tycho and Wattenhofer, Roger pp. 134-150 ISSN 1574-1192 (2017)

  • Preferred semantics as socratic discussion
    Caminada, Martin and Dvořák, Wolfgang and Vesic, Srdjan ISSN 0955-792X Oxford Journals (2014)

  • On the equivalence between logic programming semantics and argumentation semantics
    Caminada, Martin and Sá, Samy and Alcântara , João and Dvořák, Wolfgang International Journal of Approximate Reasoning , 58. pp. 87-111 ISSN 0888-613X (2014)

  • Methods for Solving Reasoning Problems in Abstract Argumentation - A Survey
    Charwat, Günther and Dvořák, Wolfgang and Gaggl, Sarah Alice and Wallner, Johannes Peter and Woltran, Stefan pp. 28-63 ISSN 0004-3702 Elsevier (2015)

  • Approximating the minimum cycle mean
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika and Raskin, Michael A. pp. 104-116 ISSN 0304-3975 (2014)

  • Polynomial-Time Algorithms for Energy Games with Special Weight Structures
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon pp. 457-492 ISSN 0178-4617 (2014)

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

  • Consistency model for runtime objects in the Open Community Runtime
    Dokulil, Jiri pp. 2725-2760 ISSN 0920-8542 Springer (2019)

  • Characteristics of multiple viewpoints in abstract argumentation
    Dunne, Paul E. and Dvořák, Wolfgang and Linsbichler, Thomas and Woltran, Stefan Artificial Intelligence , 228. pp. 153-178 ISSN 0004-3702 Elsevier (2015)

  • Parametric Properties of Ideal Semantics
    Dunne, Paul E. and Dvořák, Wolfgang and Woltran, Stefan Artificial Intelligence, 202. pp. 1-28 ISSN 0004-3702 Elsevier (2013)

  • Stage semantics and the SCC-recursive schema for argumentation semantics
    Dvořák, Wolfgang and Gaggl, Sarah Alice ISSN 0955-792X Oxford Journals (2014)

  • Maximizing a Submodular Function with Viability Constraints
    Dvořák, Wolfgang and Henzinger, Monika and Williamson, David P. ISSN 0178-4617 Springer US (2015)

  • Complexity-Sensitive Decision Procedures for Abstract Argumentation.
    Dvořák, Wolfgang and Järvisalo, Matti and Wallner, Johannes Peter and Woltran, Stefan Artificial Intelligence, 206. pp. 53-78 ISSN 0004-3702 Elsevier (In Press) (2014)

  • Comparing the expressiveness of argumentation semantics
    Dvořák, Wolfgang and Spanring, Christof ISSN 0955-792X (2016)

  • Valuation Compressions in VCG-Based Combinatorial Auctions
    Dütting, Paul and Henzinger, Monika and Starnberger, Martin ISSN 2167-8375 (2018)

  • Faster Algorithms for Semi-Matching Problems
    Fakcharoenphol, Jittat and Laekhanukit, Bundit and Nanongkai, Danupon ACM Transactions on Algorithms, 10 (3). pp. 1-23 ISSN 1549-6325 (2014)

  • Local Checkability, No Strings Attached:(A)cyclicity, Reachability, Loop Free Updates in SDNs
    Foerster, Klaus-Tycho and Luedi, Thomas and Seidel, Jochen and Wattenhofer, Roger pp. 48-63 ISSN 0304-3975 (2018)

  • On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures
    Foerster, Klaus-Tycho and Pacut, Maciej and Schmid, Stefan ISSN 0146-4833 (2019)

  • Survey of Consistent Software-Defined Network Updates
    Foerster, Klaus-Tycho and Schmid, Stefan and Vissicchio, Stefano pp. 1435-1461 ISSN 1553-877X IEEE (2018)

  • Lower and Upper Competitive Bounds for Online Directed Graph Exploration
    Foerster, Klaus-Tycho and Wattenhofer, Roger pp. 15-29 ISSN 0304-3975 (2016)

  • 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)

  • Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
    Goranci, Gramoz and Henzinger, Monika and Thorup, Mikkel ISSN 1549-6325 (2018)

  • Charting Process-Based Collaboration Support in Agile Business Networks: Aligning the Need for a Dynamic Internet of Processes from Industry and Research Perspectives.
    Grefen, Paul and Rinderle-Ma, Stefanie and Dustdar, Schahram and Fdhila, Walid and Mendling, Jan and Schulte, Stefan ISSN 1089-7801 (2018)

  • Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon ISSN 0004-5411 (2018)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon pp. 947-1006 ISSN 0097-5397 (2016)

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

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

  • Practical Minimum Cut Algorithms
    Henzinger, Monika and Noe, Alexander and Schulz, Christian and Strash, Darren ISSN 1084-6654 (2018)

  • Scalable Kernelization for Maximum Independent Sets
    Hespe, Demian and Schulz, Christian and Strash, Darren ISSN 1084-6654 (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)

  • Validity in a logic that combines supervaluation and fuzzy logic based theories of vagueness
    Krinninger, Sebastian pp. 1-17 ISSN 0165-0114 (2014)

  • 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)

  • Equivalence of Granger Causality and Transfer Entropy: A Generalization.
    Schindlerova, Katerina 3637 -3648 ISSN 1314-7552 Applied Mathematical Sciences, Hikari (2011)

  • Causality detection based on information-theoretic approaches in time series analysis.
    Schindlerova, Katerina and Palus, Milan and Vejmelka, Martin and Bhattacharya, Joydeep pp. 1-46 ISSN 0370-1573 Elsevier (2007)

  • Evaluating Transfer Entropy for Normal and γ-Order Normal Distributions.
    Schindlerova, Katerina and Toulias, Thomas and Kitsos, Christos pp. 1-20 ISSN 2231-0851 SCIENCEDOMAIN international (2016)

  • Congestion-Free Rerouting of Multiple Flows in Timed SDNs
    Zheng, Jiaqi and Li, Bo and Tian, Chen and Foerster, Klaus-Tycho and Schmid, Stefan and Chen, Guihai and Wu, Jie and Li, Rui pp. 968-981 ISSN 0733-8716 (2019)

    • Paper in Conference Proceedings or in Workshop Proceedings

  • On Polynomial-Time Congestion-Free Software-Defined Network Updates
    Akhoondian Amiri, Saeed and Dudycz, Szymon and Parham, Mahmoud and Schmid, Stefan and Wiederrecht, Sebastian In: 18th IFIP Networking Conference (IFIP Networking) , 20-22 May 2019 , Warsaw, Poland (2019)

  • Waypoint Routing in Special Networks
    Akhoondian Amiri, Saeed and Foerster, Klaus-Tycho and Jacob, Riko and Parham, Mahmoud and Schmid, Stefan In: 17th IFIP Networking Conference (IFIP Networking 2018) , 14-16 May 2018 , Zurich, Switzerland (2018)

  • Walking Through Waypoints
    Akhoondian Amiri, Saeed and Foerster, Klaus-Tycho and Schmid, Stefan In: 13th International Symposium on Latin American Theoretical Informatics (LATIN 2018) , 16-19 Apr 2018 , Buenos Aires, Argentina (2018)

  • High-Quality Shared-Memory Graph Partitioning
    Akhremtsev, Yaroslav and Sanders, Peter and Schulz, Christian In: Euro-Par 2018 - 24th International European Conference On Parallel And Distributed Computing , 27-31 August 2018 , Turin (2018)

  • Memetic multilevel hypergraph partitioning
    Andre, Robin and Schlag, Sebastian and Schulz, Christian In: The Genetic and Evolutionary Computation Conference (GECCO 2018) , July 15th-19th 2018 , Kyoto, Japan (2018)

  • Demand-Aware Network Design with Minimal Congestion and Route Lengths
    Avin, Chen and Mondal, Kaushik and Schmid, Stefan In: 39th IEEE International Conference on Computer Communications (INFOCOM) , 29 Apr - 02 May 2019 , Paris, France (2019)

  • Brief Announcement: On Self-Adjusting Skip List Networks
    Avin, Chen and Salem, Iosif and Schmid, Stefan In: 33rd International Symposium on Distributed Computing , October 14-18, 2019 , Budapest, Hungary (2019)

  • 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)

  • Incremental DFS algorithms: a theoretical and experimental study
    Baswana, Surender and Goel, Ayush and Khan, Shahbaz In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018) , January 7-10, 2018 , New Orleans, LA, USA (2018)

  • Compact Argumentation Frameworks.
    Baumann, Ringo and Dvořák, Wolfgang and Linsbichler, Thomas and Strass, Hannes and Woltran, Stefan In: 21st European Conference on Artificial Intelligence , 18-22 Aug. , Prague, Czech Republic (2014)

  • Compact Argumentation Frameworks.
    Baumann, Ringo and Dvořák, Wolfgang and Linsbichler, Thomas and Strass, Hannes and Woltran, Stefan In: 15th International Workshop on Non-Monotonic Reasoning , 17–19 July 2014 , Vienna (2014)

  • 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)

  • 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 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)

  • Dynamic Algorithms for Graph Coloring
    Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika and Nanongkai, Danupon In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018) , January 7-10, 2018 , New Orleans, LA, USA (2018)

  • Welfare Maximization with Friends-of-Friends Network Externalities
    Bhattacharya, Sayan and Dvořák, Wolfgang and Henzinger, Monika and Starnberger, Martin In: 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015) , March, 4 - 7 2015 , Munich, Germany (2015)

  • Design of Dynamic Algorithms via Primal-Dual Method
    Bhattacharya, Sayan and Henzinger, Monika and Italiano, Giuseppe F. In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • 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)

  • 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)

  • Memetic Graph Clustering
    Biedermann, Sonja and Henzinger, Monika and Schulz, Christian and Schuster, Bernhard In: 7th International Symposium on Experimental Algorithms (SEA 2018) , June 27-29 , L’Aquila, Italy (2018)

  • Wireless Evacuation on m Rays with k Searchers
    Brandt, Sebastian and Foerster, Klaus-Tycho and Richner, Benjamin and Wattenhofer, Roger In: 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2017) , 19-22 Jun 2017 , Porquerolles, France (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)

  • On the Difference between Assumption-Based Argumentation and Abstract Argumentation
    Caminada, Martin and Sá, Samy and Alcântara , João and Dvořák, Wolfgang In: 25th Belgium-Netherlands Artificial Intelligence Conference (BNAIC 2013) , 7-8 Nov 2013 , Delft, Netherlands (2013)

  • Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs
    Chalermsook, Parinya and Laekhanukit, Bundit and Nanongkai, Danupon In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014) , October 18-21, 2014 , Philadelphia, USA (2014)

  • 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)

  • Conditionally Optimal Algorithms for Generalized Büchi Games
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) , August 22-26, 2016 , Krakow (Poland) (2016)

  • 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)

  • Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018) , January 7-10, 2018 , New Orleans, LA, USA (2018)

  • Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) , July 5-8, 2016 , New York City, USA (2016)

  • Algorithms and Conditional Lower Bounds for Planning Problems
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Svozil, Alexander In: The 28th International Conference on Automated Planning and Scheduling , 27-29 June 2018 , Delft, The Netherlands (2018)

  • 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)

  • Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Svozil, Alexander In: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) , 16-21 November, 2018 , Awassa, Ethiopia (2018)

  • Approximating the minimum cycle mean
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika In: Fourth International Symposion on Games, Automata, Logics and Formal Verification (GandALF 2013) , 29 - 31 Aug 2013 , Borca di Cadore, Dolomites, Italy (2013)

  • Polynomial-time Algorithms for Energy Games with Special Weight Structures
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 20th Annual European Symposium on Algorithms (ESA 2012) , 10-12 Sep 2012 , Ljubljana, Slovenia (2012)

  • Improved Algorithms for One-Pair and k-Pair Streett Objectives
    Chatterjee, Krishnendu and Henzinger, Monika and Loitzenbauer, Veronika In: Thirtieth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives
    Chatterjee, Krishnendu and Henzinger, Monika and Loitzenbauer, Veronika and Oraee, Simin and Toman, Viktor In: 30th International Conference on Computer Aided Verification (CAV 2018) , July 14-17 , Oxford, UK (2018)

  • 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)

  • Better Strategyproof Mechanisms without Payments or Prior --- An Analytic Approach
    Cheung, Yun Kuen In: International Joint Conference on Artificial Intelligence , 9--15 July, 2016 , New York, USA (2016)

  • Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
    Cheung, Yun Kuen and Goranci, Gramoz and Henzinger, Monika In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) , 12-15 July 2016 , Rome, Italy (2016)

  • Limiting Price Discrimination when Selling Products with Positive Network Externalities
    Cigler, Luděk and Dvořák, Wolfgang and Henzinger, Monika and Starnberger, Martin In: WINE 2014: The 10th Conference on Web and Internet Economics , Dec. 14-17 , Bejing, China (2014)

  • Trade-Offs in Distributed Interactive Proofs
    Crescenzi, Pierluigi and Fraigniaud, Pierre and Paz, Ami In: International Symposium on Distributed Computing (DISC) 2019 , Oct 14-18, 2019 , Budapest, Hungary (2019)

  • Plausibility Checking of Formal Business Process Specifications in Linear Temporal Logic (Extended Abstract)
    Czepa, Christoph and Tran, Huy and Zdun, Uwe and Tran, Thanh and Weiss, Erhard and Ruhsam, Christoph In: 7th International Workshop on Enterprise Modeling and Information Systems Architectures (EMISA 2016) , 3-5 Oct 2016 , Vienna, Austria (2016)

  • Reduction Techniques for Efficient Behavioral Model Checking in Adaptive Case Management
    Czepa, Christoph and Tran, Huy and Zdun, Uwe and Tran, Thanh and Weiss, Erhard and Ruhsam, Christoph In: The 32nd ACM Symposium on Applied Computing (SAC 2017) , 3-6 Apr 2017 , Marrakesh, Morocco (2017)

  • 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)

  • Distributed verification and hardness of distributed approximation
    Das Sarma, Atish and Holzer, Stephan and Kor, Liah and Korman, Amos and Nanongkai, Danupon and Pandurangan, Gopal and Peleg, David and Wattenhofer, Roger In: STOC '11 Proceedings of the 43rd annual ACM symposium on Theory of computing , 2011, June 4-11 , San Jose, CA, USA (2011)

  • Automatic detection of synchronization errors in codes that target the Open Community Runtime
    Dokulil, Jiri and Katreniakova, Jana In: 24th International Conference on Parallel and Distributed Computing (Euro-Par 2018) , 27-31 Aug 2018 , Turin, Italy (2018)

  • Characteristics of Multiple Viewpoints in Abstract Argumentation
    Dunne, Paul E. and Dvořák, Wolfgang and Linsbichler, Thomas and Woltran, Stefan In: 4th Workshop on Dynamics of Knowledge and Belief (DKB-2013) (2013)

  • Characteristics of Multiple Viewpoints in Abstract Argumentation
    Dunne, Paul E. and Dvořák, Wolfgang and Linsbichler, Thomas and Woltran, Stefan In: 14th International Conference on Principles of Knowledge Representation and Reasoning , 2014-07-20 - 2014-07-24 , Vienna (2014)

  • Online Ad Assignment with an Ad Exchange
    Dvořák, Wolfgang and Henzinger, Monika In: Workshop on Approximation and Online Algorithms , September 11–12 , Wroclaw, Poland (2015)

  • Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract)
    Dvořák, Wolfgang and Järvisalo, Matti and Wallner, Johannes Peter and Woltran, Stefan In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015 , July 25-31, 2015 , Buenos Aires, Argentina (2015)

  • Resolution-based grounded semantics revisited.
    Dvořák, Wolfgang and Linsbichler, Thomas and Oikarinen, Emilia and Woltran, Stefan In: Fifth International Conference on Computational Models of Argument , September 9th - 12th , Scottish Highlands (2014)

  • Predicting Change Propagation Impacts in Collaborative Business processes
    Fdhila, Walid and Rinderle-Ma, Stefanie In: The 29th ACM Symposium on Applied Computing (SAC) - Enterprise Engineering , March 24-28 , 2014 , Gyeongju, Korea (2014)

  • On Evolving Partitioned Web Service Orchestrations
    Fdhila, Walid and Rinderle-Ma, Stefanie and Baouab, Aymen and Perrin, Olivier and Godart, Claude In: The 5th International Conference on Service-oriented computing and Applications (SOCA 2012) , 17-19 Dec 2012 , taipei, Taiwan (In Press) (2012)

  • Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks
    Fenz, Thomas and Foerster, Klaus-Tycho and Schmid, Stefan and Villedieu, Anaïs In: 18th IFIP Networking Conference (IFIP Networking) , 20-22 May 2019 , Warsaw, Poland (2019)

  • Engineering Kernelization for Maximum Cut
    Ferizovic, Damir and Hespe, Demian and Lamm, Sebastian and Mnich, Matthias and Schulz, Christian and Strash, Darren In: Algorithm Engineering and Experimentation (ALENEX 2020) , Jan 5-6, 2020 , Salt Lake City, Utah, U.S. (2020)

  • Approximating Fault-Tolerant Domination in General Graphs
    Foerster, Klaus-Tycho In: 10th Meeting on Analytic Algorithmics and Combinatorics (ANALCO 2013) , Jan 6 2013 , New Orleans, USA (2013)

  • Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network Updates
    Foerster, Klaus-Tycho In: ACM Symposium on Principles of Distributed Computing (PODC) , 29 JUL - AUG 02 , Toronto, Canada (2019)

  • On the Consistent Migration of Splittable Flows: Latency-Awareness and Complexities
    Foerster, Klaus-Tycho In: 17th IEEE International Symposium on Network Computing and Applications (NCA) , 1-3 Nov 2018 , Cambridge, MA, USA (2018)

  • On the Consistent Migration of Unsplittable Flows: Upper and Lower Complexity Bounds
    Foerster, Klaus-Tycho In: 16th IEEE International Symposium on Network Computing and Applications (NCA 2017) , 30 Oct - 1 Nov 2017 , Cambridge, USA (2017)

  • Multi-Agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds
    Foerster, Klaus-Tycho and Groner, Linus and Hoefler, Torsten and Koenig, Michael and Schmid, Sascha and Wattenhofer, Roger In: 10th International Conference on Algorithms and Complexity (CIAC 2017) , 24-26 May 2017 , Athens, Greece (2017)

  • On the Power of Preprocessing in Decentralized Network Optimization
    Foerster, Klaus-Tycho and Hirvonen, Juho and Schmid, Stefan and Suomela, Jukka In: 39th IEEE International Conference on Computer Communications (INFOCOM) , 29 Apr - 02 May 2019 , Paris, France (2019)

  • Bonsai: Efficient Fast Failover Routing
    Foerster, Klaus-Tycho and Kamisinski, Andrzej and Pignolet, Yvonne-Anne and Schmid, Stefan and Tredan, Gilles In: 49th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) , 24-27 Jun 2019 , Portland, Oregon, USA (2019)

  • Improved Fast Rerouting Using Postprocessing
    Foerster, Klaus-Tycho and Kamisinski, Andrzej and Pignolet, Yvonne-Anne and Schmid, Stefan and Tredan, Gilles In: 38th International Symposium on Reliable Distributed Systems (SRDS) 2019 , 1-4 Oct 2019 , Lyon, France (2019)

  • Brief Announcement: Does Preprocessing Help under Congestion?
    Foerster, Klaus-Tycho and Korhonen, Janne H. and Rybicki, Joel and Schmid, Stefan In: ACM Symposium on Principles of Distributed Computing (PODC 2019) , 29 Jul - 02 Aug 2019 , Toronto, Canada (2019)

  • Local Checkability, No Strings Attached
    Foerster, Klaus-Tycho and Luedi, Thomas and Seidel, Jochen and Wattenhofer, Roger In: 17th International Conference on Distributed Computing and Networking (ICDCN 2016) , 4-7 Jan 2016 , Singapore, Singapore (2016)

  • Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
    Foerster, Klaus-Tycho and Nuridini, Rijad and Uitto, Jara and Wattenhofer, Roger In: 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2015) , 15-17 Jul 2015 , Montserrat, Spain (2015)

  • TI-MFA: Keep Calm and Reroute Segments Fast
    Foerster, Klaus-Tycho and Parham, Mahmoud and Chiesa, Marco and Schmid, Stefan In: 21st IEEE Global Internet Symposium (GI 2018) , 16 Apr 2018 , Honolulu, USA (2018)

  • A Walk in the Clouds: Routing through VNFs on Bidirected Networks
    Foerster, Klaus-Tycho and Parham, Mahmoud and Schmid, Stefan In: 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017) , 5 Sept 2017 , Vienna, Austria (2017)

  • Local Fast Segment Rerouting on Hypercubes
    Foerster, Klaus-Tycho and Parham, Mahmoud and Schmid, Stefan and Wen, Tao In: 22nd International Conference on Principles of Distributed Systems (OPODIS) , 17-19 Dec 2018 , Hong Kong (2018)

  • CASA: Congestion and Stretch Aware Static Fast Rerouting
    Foerster, Klaus-Tycho and Pignolet, Yvonne-Anne and Schmid, Stefan and Tredan, Gilles In: 39th IEEE International Conference on Computer Communications (INFOCOM) , 29 Apr - 02 May 2019 , Paris, France (2019)

  • Local Checkability in Dynamic Networks
    Foerster, Klaus-Tycho and Richter, Oliver and Seidel, Jochen and Wattenhofer, Roger In: 18th International Conference on Distributed Computing and Networking (ICDCN 2017) , 5-7 Jan 2017 , Hyderabad, India (2017)

  • Deterministic Leader Election in Multi-hop Beeping Networks
    Foerster, Klaus-Tycho and Seidel, Jochen and Wattenhofer, Roger In: 28th International Symposium on Distributed Computing (DISC 2014) , 12-15 Oct 2014 , Austin, USA (2014)

  • Latency and Consistent Flow Migration: Relax for Lossless Updates
    Foerster, Klaus-Tycho and Vanbever, Laurent and Wattenhofer, Roger In: 18th IFIP Networking Conference (IFIP Networking) , 20-22 May 2019 , Warsaw, Poland (2019)

  • Directed Graph Exploration
    Foerster, Klaus-Tycho and Wattenhofer, Roger In: 16th International Conference On Principles Of Distributed Systems (OPODIS 2012) , 17-20 Dec 2012 , Rome, Italy (2012)

  • Communication-free Massively Distributed Graph Generation
    Funke, Daniel and Lamm, Sebastian and Sanders, Peter and Schulz, Christian and Strash, Darren and von Looz, Moritz In: 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS) , May 25, 2018 , Vancouver (2018)

  • 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)

  • A Tree Structure For Dynamic Facility Location
    Goranci, Gramoz and Henzinger, Monika and Leniowski, Dariusz In: 26th Annual European Symposium on Algorithms (ESA 2018) , 20-24 August 2018 , Helsinki, Finland (2018)

  • Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan In: 26th Annual European Symposium on Algorithms (ESA 2018) , 20-24 August 2018 , Helsinki, Finland (2018)

  • 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)

  • Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
    Goranci, Gramoz and Henzinger, Monika and Thorup, Mikkel In: 24th Annual European Symposium on Algorithms (ESA 2016) , 22-26 Aug 2016 , Aarhus, Denmark (2016)

  • Vertex Sparsification in Trees
    Goranci, Gramoz and Räcke, Harald In: 14th Workshop on Approximation and Online Algorithms (WAOA) 2016 , August 25-26, 2016 , Aarhus, Denmark (2016)

  • Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
    Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian In: Algorithm Engineering and Experimentation (ALENEX 2020) , Jan 5-6, 2020 , Salt Lake City, Utah, U.S. (2020)

  • 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)

  • ILP-based Local Search for Graph Partitioning
    Henzinger, Alexandra and Noe, Alexander and Schulz, Christian In: 17th International Symposium on Experimental Algorithms (SEA 2018) , June 27-29 , L’Aquila, Italy (2018)

  • Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
    Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014) , October 18-21, 2014 , Philadelphia, USA (2014)

  • A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: STOC 2016: 48th Annual Symposium on the Theory of Computing , 19-21 Jun 2016 , Cambridge, MA, USA (2016)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: FOCS 2013 54th Annual IEEE Symposium on Foundations of Computer Science , October 27-29, 2013 , Berkeley, USA (In Press) (2013)

  • Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 46th ACM Symposium on Theory of Computing (STOC 2014) , June 1 – June 3, 2014 , New York, NY, USA (2014)

  • Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 40th International Colloquium on Automata, Languages and Programming (ICALP 2013) , 8-12 July 2013 , Riga, Latvia (In Press) (2013)

  • A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 25th ACM-SIAM Symposium on Discrete Algorithms (SODA14) , January 5-7, 2014 , Portland, USA (In Press) (2014)

  • Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon and Saranurak, Thatchaphol In: 47th ACM Symposium on Theory of Computing (STOC 2015) , June 14 - June 17 , Portland, OR, USA (2015)

  • 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)

  • Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
    Henzinger, Monika and Nanongkai, Danupon and Krinninger, Sebastian In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning
    Henzinger, Monika and Neumann, Stefan In: 24th Annual European Symposium on Algorithms (ESA 2016) , 22-26 Aug 2016 , Aarhus, Denmark (2016)

  • Shared-Memory Branch-and-Reduce for Multiterminal Cuts
    Henzinger, Monika and Noe, Alexander and Schulz, Christian In: Algorithm Engineering and Experimentation (ALENEX 2020) , Jan 5-6, 2020 , Salt Lake City, Utah, U.S. (2020)

  • Practical Minimum Cut Algorithms
    Henzinger, Monika and Noe, Alexander and Schulz, Christian and Strash, Darren In: 2018 20th Workshop on Algorithm Engineering and Experiments (ALENEX) , January 7-8, 2018 , New Orleans, USA (2018)

  • Shared-memory Exact Minimum Cuts
    Henzinger, Monika and Noe, Alexander and Schulz, Christian and Strash, Darren 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 In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 2017 , January 16-19, 2017 , Barcelona, Spain (2017)

  • Multi-parameter mechanism design under budget and matroid constraints
    Henzinger, Monika and Vidali, Angelina In: 19th Annual European Symposium on Algorithms (ESA 2011) , September 5-9, 2011 , Saarbruecken, Germany (In Press) (2011)

  • WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track
    Hespe, Daniel and Lamm, Sebastian and Schulz, Christian and Strash, Darren In: IPEC 2019: 14th International Symposium on Parameterized and Exact Computation , September 11-13, 2019 , Munich, Germany (2019)

  • Scalable Kernelization for Maximum Independent Sets
    Hespe, Demian and Schulz, Christian and Strash, Darren In: 18th Workshop on Algorithm Engineering and Experimentation (ALENEX) , January 7, 2018 , New Orleans (2018)

  • 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)

  • Distributed Symmetry Breaking in Hypergraphs
    Kutten, Shay and Nanongkai, Danupon and Pandurangan, Gopal and Robinson, Peter In: 28th International Symposium on Distributed Computing 2014 , 12-15 October 2014 , Austin, Texas, USA (2014)

  • Exactly Solving the Maximum Weight Independent Set Problem onLarge 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)

  • CASM - Optimized Compilation of Abstract State Machines
    Lezuo, Roland and Paulweber, Philipp and Krall, Andreas In: ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES) , 12-13 June 2014 , Edinburgh, UK (2014)

  • 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)

  • A Constant Approximation for Maximum Throughput Multicommodity Routing
    Liu, Mengxue and Richa, Andrea and Schmid, Stefan and Rost, Matthias In: 39th IEEE International Conference on Computer Communications (INFOCOM) , 29 Apr - 02 May 2019 , Paris, France (2019)

  • 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)

  • Evolutionary multi-level acyclic graph partitioning
    Moreira, Orlando and Popp, Merten and Schulz, Christian In: The Genetic and Evolutionary Computation Conference (GECCO 2018) , July 15th-19th 2018 , Kyoto, Japan (2018)

  • 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)

  • A tight unconditional lower bound on distributed randomwalk computation
    Nanongkai, Danupon and Das Sarma, Atish and Pandurangan, Gopal In: PODC '11 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , 2011, June 4-11 , San Jose, CA, USA (2011)

  • Almost-Tight Distributed Minimum Cut Algorithms
    Nanongkai, Danupon and Su, Hsin-Hao In: 28th International Symposium on Distributed Computing 2014 , 12-15 October 2014 , Austin, Texas, USA (2014)

  • Bipartite Stochastic Block Models with Tiny Clusters
    Neumann, Stefan In: Thirty-second Conference on Neural Information Processing Systems (NIPS) 2018 , 3-7 Dec 2018 , Montreal, Canada (2018)

  • 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)

  • What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank
    Neumann, Stefan and Gemulla, Rainer and Miettinen, Pauli In: 16th IEEE International Conference on Data Mining 2016 (ICDM'16) , 12-15 December 2016 , Barcelona (2016)

  • 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)

  • Ranking the Teams in European Football Leagues With Agony
    Neumann, Stefan and Ritter, Julian and Budhathoki, Kailash In: 5th Workshop on Machine Learning and Data Mining for Sports Analytics at ECML/PKDD 2018 , 10-14 Sep 2018 , Dublin, Ireland (2018)

  • This House Proves That Debating Is Harder Than Soccer
    Neumann, Stefan and Wiese, Andreas In: Eighth International Conference on Fun with Algorithms (FUN 2016) , June 8 – 10, 2016 , La Maddalena, Maddalena Islands, Italy (2016)

  • Unified (A)Synchronous Circuit Development
    Paulweber, Philipp and Maier, Jürgen and Cortadella, Jordi In: 25th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC) , 12-15 May 2019 , Hirosaki, Japan (2019)

  • CASM-IR: Uniform ASM-Based Intermediate Representation for Model Specification, Execution, and Transformation
    Paulweber, Philipp and Pescosta, Emmanuel and Zdun, Uwe In: 6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ) , 5-8 June 2018 , Southampton, UK (2018)

  • A Model-Based Transformation Approach to Reuse and Retarget CASM Specifications
    Paulweber, Philipp and Zdun, Uwe In: 5th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ) , 23-27 May 2016 , Linz, Austria (2016)

  • Estimating Graph Parameters from Random Order Streams
    Peng, Pan and Sohler, Christian In: Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018) , January 7-10, 2018 , New Orleans, LA, USA (2018)

  • Distributed Self-Adjusting Tree Networks
    Peres, Bruna and de Oliveira Souza, Otavio Augusto and Goussevskaia, Olga and Avin, Chen and Schmid, Stefan In: 39th IEEE International Conference on Computer Communications (INFOCOM) , 29 Apr - 02 May 2019 , Paris, France (2019)

  • How Paradoxical is the "Paradox of Side Payments"? Notes from a Network Interconnection Perspective.
    Reichl, Peter and Zwickl, Patrick and Löw, Christian and Maillé, Patrick In: 11th International Conference on Wired/Wireless Internet Communications (WWIC’13) , June 5 - 7, 2013 , St. Petersburg (2013)

  • 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)

  • 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)

  • 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)

  • Design of an Executable Specification Language Using Eye Tracking
    Simhandl, Georg and Paulweber, Philipp and Zdun, Uwe In: 6th International Workshop on Eye Movements in Programming (EMIP) , 27 May 2019 , Montreal, Canada (2019)

  • Distributed QR Factorization Based on Randomized Algorithms
    Strakova, Hana and Gansterer, Wilfried and Zemen, T. In: 9th International Conference on Parallel Processing and Applied Mathematics (PPAM) 2011 , 11-14 Sep 2011 , Torun, Poland (2011)

  • 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)

  • Graph-Theoretic Roots of Value Network Quantification
    Zwickl, Patrick and Reichl, Peter In: 19th EUNICE Workshop on Advances in Communication Networking , August 2013 , Chemnitz (2013)

    • Book Section/Chapter

  • Benchmarking for Graph Clustering and Partitioning
    Bader, David and Kappes, Andrea and Meyerhenke, Henning and Sanders, Peter and Schulz, Christian and Wagner, Dorothea In: Encyclopedia of Social Network Analysis and Mining. Springer-Verlag New York (2018)

  • Memetic Graph Clustering
    Biedermann, Sonja and Henzinger, Monika and Schulz, Christian In: Protein-Protein Interaction Networks. Methods in Molecular Biology. Springer (2019)

  • Computationale Aspekte der Abstrakten Argumentation.
    Dvořák, Wolfgang In: Ausgezeichnete Informatikdissertationen 2012. Lecture Notes in Informatics (LNI) (D-13) Bonner Köllen Verlag, pp. 61-70 ISBN 978-3-88579-417-2 (2013)

  • Reduction-Based Approaches to Implement Modgil's Extended Argumentation Frameworks
    Dvořák, Wolfgang and Gaggl, Sarah Alice and Linsbichler, Thomas and Wallner, Johannes Peter In: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. Lecture Notes in Computer Science, 9060 Springer International Publishing, pp. 249-264 (2015)

  • Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems.
    Dvořák, Wolfgang and Gaggl, Sarah Alice and Wallner, Johannes Peter and Woltran, Stefan In: Applications of Declarative Programming and Knowledge Management Applications of Declarative Programming and Knowledge Management. Lecture Notes in Computer Science (7773) Springer Berlin Heidelberg, pp. 114-133 ISBN 978-3-642-41523-4 (2013)

  • dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation
    Dvořák, Wolfgang and Morak, Michael and Nopp, Clemens and Woltran, Stefan In: Applications of Declarative Programming and Knowledge Management. Lecture Notes in Computer Science (7773) Springer Berlin Heidelberg, pp. 259-268 ISBN 978-3-642-41523-4 (2013)

  • PageRank Algorithm
    Henzinger, Monika In: Encyclopedia of Algorithms. Springer, pp. 1509-1511 (2016)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: Encyclopedia of Algorithms. Springer, pp. 600-602 (2016)

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

    • Technical Report

  • Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs
    Brandt, Sebastian and Foerster, Klaus-Tycho and Maurer, Jonathan and Wattenhofer, Roger Technical Report. UNSPECIFIED (2019)

  • A systematic literature review on process model testing: Approaches, challenges, and research directions
    Böhmer, Kristof and Rinderle-Ma, Stefanie Technical Report. arXiv.org (2015)

  • CEGARTIX v0.4: A SAT-Based Counter-Example Guided Argumentation Reasoning Tool
    Dvořák, Wolfgang and Järvisalo, Matti and Wallner, Johannes Peter and Woltran, Stefan Other. UNSPECIFIED (2015)

  • Survey of Consistent Software-Defined Network Updates
    Foerster, Klaus-Tycho and Schmid, Stefan and Vissicchio, Stefano Technical Report. UNSPECIFIED (Unpublished) (2018)

  • The Solitaire Memory Game
    Foerster, Klaus-Tycho and Wattenhofer, Roger Technical Report. UNSPECIFIED (Unpublished) (2013)

    • This list was generated on Mon Oct 14 20:14:27 2019 CEST.
    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.