| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147265 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147421 | 2024-01-15 | Paper |
| Structural parameterization of cluster deletion | 2023-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075938 | 2023-09-20 | Paper |
| Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice | 2023-06-23 | Paper |
| Compressed Weighted de Bruijn Graphs | 2023-06-14 | Paper |
| Dynamic 2- and 3-connectivity on planar graphs | 2022-12-09 | Paper |
| Dispersion of mobile robots on directed anonymous graphs | 2022-11-11 | Paper |
| A Family of Tree-Based Generators for Bubbles in Directed Graphs | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091155 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090485 | 2022-07-18 | Paper |
| A family of tree-based generators for bubbles in directed graphs | 2022-06-28 | Paper |
| Dynamic Dominators and Low-High Orders in DAGs | 2022-05-11 | Paper |
| Dynamically switching vertices in planar graphs (extended abstract) | 2021-12-20 | Paper |
| Tropical paths in vertex-colored graphs | 2021-11-25 | Paper |
| Decremental SPQR-trees for Planar Graphs | 2021-08-04 | Paper |
| Strong Connectivity in Directed Graphs under Failures, with Applications | 2020-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111373 | 2020-05-27 | Paper |
| All-Pairs 2-Reachability in O(n^w log n) Time | 2020-05-27 | Paper |
| Contracting a Planar Graph Efficiently | 2020-05-27 | Paper |
| Incremental strong connectivity and 2-connectivity in directed graphs | 2020-02-12 | Paper |
| Approximating the smallest 2-vertex connected spanning subgraph of a directed graph | 2020-01-22 | Paper |
| 2-Connectivity in Directed Graphs: An Experimental Study | 2019-09-12 | Paper |
| Computing Critical Nodes in Directed Graphs | 2019-09-12 | Paper |
| Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study | 2019-09-12 | Paper |
| Maintaining spanning trees of small diameter | 2019-04-29 | Paper |
| Maximum colorful cycles in vertex-colored graphs | 2018-11-28 | Paper |
| Computing Critical Nodes in Directed Graphs | 2018-11-20 | Paper |
| 2-Edge Connectivity in Directed Graphs | 2018-11-05 | Paper |
| Maximum colorful cliques in vertex-colored graphs | 2018-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580153 | 2018-08-13 | Paper |
| Strong Connectivity in Directed Graphs under Failures, with Applications | 2018-07-16 | Paper |
| Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs | 2018-07-16 | Paper |
| Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching | 2018-07-04 | Paper |
| Efficient splitting and merging algorithms for order decomposable problems | 2018-07-04 | Paper |
| Dynamic algorithms via the primal-dual method | 2018-06-14 | Paper |
| 2-vertex connectivity in directed graphs | 2018-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643862 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643863 | 2018-05-29 | Paper |
| Tropical paths in vertex-colored graphs | 2018-03-26 | Paper |
| 2-Connectivity in Directed Graphs (Invited Talk) | 2018-03-02 | Paper |
| On bubble generators in directed graphs | 2018-01-04 | Paper |
| Incremental 2-Edge-Connectivity in Directed Graphs | 2017-12-19 | Paper |
| Sparse certificates for 2-connectivity in directed graphs | 2017-11-06 | Paper |
| Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching | 2017-10-05 | Paper |
| 2-Edge Connectivity in Directed Graphs | 2017-10-05 | Paper |
| Decremental single-source reachability in planar digraphs | 2017-08-17 | Paper |
| On resilient graph spanners | 2016-05-31 | Paper |
| Strong articulation points and strong bridges in large scale graphs | 2016-04-06 | Paper |
| Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs | 2015-11-19 | Paper |
| Design of Dynamic Algorithms via Primal-Dual Method | 2015-10-27 | Paper |
| 2-Vertex Connectivity in Directed Graphs | 2015-10-27 | Paper |
| Experimental analysis of dynamic all pairs shortest path algorithms | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501809 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501281 | 2015-08-03 | Paper |
| Separator based sparsification for dynamic planar graph algorithms | 2015-05-07 | Paper |
| Data structures resilient to memory faults | 2015-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934637 | 2014-12-18 | Paper |
| Resilient dictionaries | 2014-11-18 | Paper |
| Designing reliable algorithms in unreliable memories | 2014-10-07 | Paper |
| Improved algorithms for min cut and max flow in undirected planar graphs | 2014-06-05 | Paper |
| Is Timetabling Routing Always Reliable for Public Transportl | 2014-02-24 | Paper |
| Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks | 2013-12-06 | Paper |
| On resilient graph spanners | 2013-09-17 | Paper |
| On a facility location problem with applications to tele-diagnostic | 2013-08-27 | Paper |
| Near real-time suffix tree construction via the fringe marked ancestor problem | 2013-06-24 | Paper |
| Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs | 2012-11-02 | Paper |
| On suffix extensions in suffix trees | 2012-10-11 | Paper |
| An Experimental Study of Dynamic Dominators | 2012-09-25 | Paper |
| Finding strong bridges and strong articulation points in linear time | 2012-08-13 | Paper |
| Novel Local-Search-Based Approaches to University Examination Timetabling | 2012-07-28 | Paper |
| COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING | 2011-03-25 | Paper |
| Finding Strong Bridges and Strong Articulation Points in Linear Time | 2011-01-08 | Paper |
| A new approach to dynamic all pairs shortest paths | 2010-08-16 | Paper |
| Sorting and searching in the presence of memory faults (without redundancy) | 2010-08-15 | Paper |
| Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming | 2010-07-20 | Paper |
| Resilient Algorithms and Data Structures | 2010-05-28 | Paper |
| Optimal resilient sorting and searching in the presence of memory faults | 2009-11-04 | Paper |
| Graph spanners in the streaming model: An experimental study | 2009-08-27 | Paper |
| Small stretch \((\alpha ,\beta )\)-spanners in the streaming model | 2009-08-21 | Paper |
| The price of resiliency: a case study on sorting with memory faults | 2009-05-06 | Paper |
| Sorting and searching in faulty memories | 2009-03-24 | Paper |
| Optimal Resilient Sorting and Searching in the Presence of Memory Faults | 2009-03-12 | Paper |
| Small Stretch Spanners on Dynamic Graphs | 2009-01-19 | Paper |
| Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O ( n 2 barrier | 2008-12-21 | Paper |
| Optimal Resilient Dynamic Dictionaries | 2008-09-25 | Paper |
| Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments | 2008-09-25 | Paper |
| Algorithms and Constraint Programming | 2008-09-09 | Paper |
| Mantaining dynamic matrices for fully dynamic transitive closure | 2008-07-01 | Paper |
| Improved Approximation for Single-Sink Buy-at-Bulk | 2008-04-24 | Paper |
| Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? | 2008-03-11 | Paper |
| The Price of Resiliency: A Case Study on Sorting with Memory Faults | 2008-03-11 | Paper |
| A new approach to dynamic all pairs shortest paths | 2008-01-14 | Paper |
| CHECKCOL: improved local search for graph coloring | 2007-11-05 | Paper |
| Design of trees in the hose model: the balanced case | 2007-02-19 | Paper |
| Dynamic shortest paths and transitive closure: algorithmic techniques and data structures | 2006-10-31 | Paper |
| Fully dynamic all pairs shortest paths with real edge weights | 2006-07-12 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Algorithmic aspects in speech recognition | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668725 | 2005-04-15 | Paper |
| Fully dynamic planarity testing with applications | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737195 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426347 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417670 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707794 | 2003-06-11 | Paper |
| Efficient splitting and merging algorithms for order decomposable problems. | 2003-01-14 | Paper |
| An algorithm for finding a \(k\)-median in a directed tree | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536342 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230327 | 2002-01-17 | Paper |
| Dynamically switching vertices in planar graphs | 2001-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945539 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218092 | 1999-07-14 | Paper |
| Maintaining spanning trees of small diameter | 1999-06-22 | Paper |
| Separator-Based Sparsification II: Edge and Vertex Connectivity | 1998-09-21 | Paper |
| Sparsification—a technique for speeding up dynamic graph algorithms | 1998-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875185 | 1996-10-21 | Paper |
| Decremental 2- and 3-connectivity on planar graphs | 1996-10-16 | Paper |
| Separator based sparsification. I: Planarity testing and minimum spanning trees | 1996-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858443 | 1995-12-13 | Paper |
| Sparse dynamic programming II | 1995-07-13 | Paper |
| The Set Union Problem with Unlimited Backtracking | 1994-12-21 | Paper |
| Sparse dynamic programming I | 1994-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138871 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138872 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138931 | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138950 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036576 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037440 | 1993-05-18 | Paper |
| Maintaining the 3-Edge-Connected Components of a Graph On-Line | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028899 | 1993-03-28 | Paper |
| Fully Dynamic Algorithms for 2-Edge Connectivity | 1993-03-09 | Paper |
| On-line computation of minimal and maximal length paths | 1992-06-28 | Paper |
| Incremental algorithms for minimal length paths | 1992-06-28 | Paper |
| Maintenance of a minimum spanning forest in a dynamic plane graph | 1992-06-28 | Paper |
| On-line algorithms for polynomially solvable satisfiability problems | 1992-06-25 | Paper |
| A note on set union with arbitrary deunions | 1991-01-01 | Paper |
| The set union problem with dynamic weighted backtracking | 1991-01-01 | Paper |
| Predicting deadlock in store‐and‐forward networks | 1990-01-01 | Paper |
| Dynamic maintenance of directed hypergraphs | 1990-01-01 | Paper |
| Worst-case analysis of the set-union problem with extended backtracking | 1989-01-01 | Paper |
| Finding paths and deleting edges in directed acyclic graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787478 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817607 | 1988-01-01 | Paper |
| Amortized efficiency of a path retrieval data structure | 1986-01-01 | Paper |
