| Publication | Date of Publication | Type |
|---|
| Giant components in random temporal graphs | 2025-01-14 | Paper |
| Parallel approximation of optimization problems | 2024-06-21 | Paper |
| Upward drawings of search trees (extended abstract) | 2024-06-05 | Paper |
| On Computing the Diameter of (Weighted) Link Streams | 2024-04-14 | Paper |
| Thirty years of SIROCCO a data and graph mining comparative analysis of its temporal evolution | 2024-01-11 | Paper |
| Minimum vertex cover, distributed decision-making, and communication complexity | 2024-01-05 | Paper |
| Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks | 2023-12-18 | Paper |
| Structure in approximation classes | 2023-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6159898 | 2023-06-23 | Paper |
| A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs | 2023-04-03 | Paper |
| The parallel complexity of approximating the High Degree Subgraph problem | 2023-03-21 | Paper |
| Trade-offs in distributed interactive proofs | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089189 | 2022-07-18 | Paper |
| Giant Components in Random Temporal Graphs | 2022-05-30 | Paper |
| On computing Pareto optimal paths in weighted time-dependent networks | 2021-03-11 | Paper |
| Computing Top-k Closeness Centrality Faster in Unweighted Graphs | 2019-09-12 | Paper |
| Improving the Betweenness Centrality of a Node by Adding Links | 2018-11-20 | Paper |
| An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs | 2018-07-16 | Paper |
| Into the square: on the complexity of some quadratic-time solvable problems | 2016-08-05 | Paper |
| Rumor spreading in random evolving graphs | 2016-03-22 | Paper |
| On the complexity of the shortest-path broadcast problem | 2015-12-10 | Paper |
| On Computing the Hyperbolicity of Real-World Graphs | 2015-11-19 | Paper |
| Synchronous context-free grammars and optimal linear parsing strategies | 2015-07-13 | Paper |
| Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs | 2015-05-26 | Paper |
| Parsimonious flooding in dynamic graphs | 2014-07-23 | Paper |
| Adding Test Generation to the Teaching Machine | 2014-04-15 | Paper |
| On computing the diameter of real-world undirected graphs | 2013-12-11 | Paper |
| Rumor Spreading in Random Evolving Graphs | 2013-09-17 | Paper |
| Smooth movement and Manhattan path based random waypoint mobility | 2013-04-04 | Paper |
| Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone | 2012-11-02 | Paper |
| Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets | 2012-10-11 | Paper |
| Parsimonious flooding in dynamic graphs | 2012-02-06 | Paper |
| A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs | 2011-05-12 | Paper |
| Finding the Diameter in Real-World Graphs | 2010-09-06 | Paper |
| Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications | 2010-02-24 | Paper |
| The minimum likely column cover problem | 2009-07-09 | Paper |
| Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings | 2009-01-20 | Paper |
| On-line load balancing made simple: greedy strikes back | 2008-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461521 | 2005-07-26 | Paper |
| Optimal covering designs: complexity results and new bounds | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472452 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471654 | 2004-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470516 | 2004-07-01 | Paper |
| On-line algorithms for the channel assignment problem in cellular networks. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449245 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426347 | 2003-09-16 | Paper |
| Text sparsification via local maxima. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785466 | 2003-02-04 | Paper |
| On the Hamming distance of constraint satisfaction problems. | 2003-01-21 | Paper |
| On weighted vs unweighted versions of combinatorial optimization problems | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542582 | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762500 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527188 | 2001-04-26 | Paper |
| On approximating a scheduling problem | 2001-01-01 | Paper |
| On approximation scheme preserving reducibility and its applications | 2000-06-07 | Paper |
| Max NP-completeness made easy | 2000-01-12 | Paper |
| Structure in Approximation Classes | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258216 | 1999-09-01 | Paper |
| Sperner's lemma and robust machines | 1999-05-09 | Paper |
| Strictly-upward drawings of ordered search trees | 1999-01-12 | Paper |
| The parallel complexity of approximating the high degree subgraph problem | 1999-01-12 | Paper |
| Linear area upward drawings of AVL trees | 1998-04-13 | Paper |
| On the distributed decision-making complexity of the minimum vertex cover problem | 1997-12-04 | Paper |
| Approximate solution of NP optimization problems | 1997-02-28 | Paper |
| Reversible simulation of space-bounded computations | 1997-02-28 | Paper |
| Complexity classes and sparse oracles | 1995-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4293543 | 1994-05-29 | Paper |
| AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS | 1994-01-26 | Paper |
| A note on the descriptive complexity of maximization problems | 1994-01-13 | Paper |
| A note on optimal area algorithms for upward drawings of binary trees | 1993-05-16 | Paper |
| A uniform approach to define complexity classes | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974859 | 1992-06-26 | Paper |
| Minimum-delay schedules in layered networks | 1992-06-25 | Paper |
| Completeness in approximation classes | 1991-01-01 | Paper |
| Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems | 1990-01-01 | Paper |
| DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING | 1990-01-01 | Paper |
