| Publication | Date of Publication | Type |
|---|
| Graphs with minimum fractional domatic number | 2024-01-02 | Paper |
| Payment scheduling in the interval debt model | 2023-08-14 | Paper |
| The Complexity of Transitively Orienting Temporal Graphs | 2023-08-08 | Paper |
| The complexity of growing a graph | 2023-08-04 | Paper |
| Computing maximum matchings in temporal graphs | 2023-07-10 | Paper |
| Equitable scheduling on a single machine | 2023-06-27 | Paper |
| Computing maximum matchings in temporal graphs. | 2023-02-07 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092419 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089192 | 2022-07-18 | Paper |
| Temporal Vertex Cover with a Sliding Time Window | 2021-07-28 | Paper |
| Sliding window temporal graph coloring | 2021-06-30 | Paper |
| The temporal explorer who returns to the base | 2021-06-30 | Paper |
| Interference-free Walks in Time: Temporally Disjoint Paths | 2021-05-18 | Paper |
| Deleting edges to restrict the size of an epidemic in temporal networks | 2021-04-14 | Paper |
| The power of linear-time data reduction for maximum matching | 2020-11-11 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs? | 2020-09-07 | Paper |
| Binary Search in Graphs Revisited | 2020-05-26 | Paper |
| The Power of Linear-Time Data Reduction for Maximum Matching | 2020-05-26 | Paper |
| The temporal explorer who returns to the base | 2020-02-06 | Paper |
| Temporal vertex cover with a sliding time window | 2019-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743450 | 2019-05-10 | Paper |
| Binary search in graphs revisited | 2019-05-07 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2019-05-07 | Paper |
| Temporal network optimization subject to connectivity constraints | 2019-04-25 | Paper |
| The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs | 2019-01-14 | Paper |
| A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs | 2018-12-05 | Paper |
| Strong bounds for evolution in networks | 2018-09-07 | Paper |
| Kernelization lower bounds for finding constant-size subgraphs | 2018-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583882 | 2018-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634388 | 2018-04-10 | Paper |
| Stably Computing Order Statistics with Arithmetic Population Protocols | 2018-03-21 | Paper |
| Online regenerator placement | 2017-10-12 | Paper |
| The complexity of optimal design of temporally connected graphs | 2017-10-12 | Paper |
| Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity | 2017-10-09 | Paper |
| On the fixation probability of superstars | 2017-09-29 | Paper |
| Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365119 | 2017-09-29 | Paper |
| Minimum bisection is NP-hard on unit disk graphs | 2017-09-28 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2017-09-22 | Paper |
| Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs | 2017-09-07 | Paper |
| Determining majority in networks with local interactions and very small local memory | 2017-03-29 | Paper |
| Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. | 2017-02-27 | Paper |
| Graph editing to a given degree sequence | 2017-02-06 | Paper |
| New geometric representations and domination problems on tolerance and multitolerance graphs. | 2017-01-24 | Paper |
| Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs | 2016-10-21 | Paper |
| New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs | 2016-09-09 | Paper |
| Graph Editing to a Given Degree Sequence | 2016-07-25 | Paper |
| Intersection graphs of L-shapes and segments in the plane | 2016-05-02 | Paper |
| Algorithms and almost tight results for 3-colorability of small diameter graphs | 2016-03-23 | Paper |
| On Temporally Connected Graphs of Small Cost | 2016-02-26 | Paper |
| On the intersection of tolerance and cocomparability graphs | 2015-12-10 | Paper |
| The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial | 2015-07-31 | Paper |
| Optimizing busy time on parallel machines | 2014-12-02 | Paper |
| Approximating fixation probabilities in the generalized Moran process | 2014-11-19 | Paper |
| Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs | 2014-11-04 | Paper |
| Minimum Bisection Is NP-hard on Unit Disk Graphs | 2014-10-14 | Paper |
| Intersection Graphs of L-Shapes and Segments in the Plane | 2014-10-14 | Paper |
| An intersection model for multitolerance graphs: efficient algorithms and hierarchy | 2014-07-03 | Paper |
| Determining Majority in Networks with Local Interactions and Very Small Local Memory | 2014-07-01 | Paper |
| Computing and counting longest paths on circular-arc graphs in polynomial time | 2014-05-05 | Paper |
| Parameterized domination in circle graphs | 2014-03-25 | Paper |
| On the Recognition of Four-Directional Orthogonal Ray Graphs | 2013-09-20 | Paper |
| The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial | 2013-09-17 | Paper |
| Temporal Network Optimization Subject to Connectivity Constraints | 2013-08-07 | Paper |
| Strong Bounds for Evolution in Networks | 2013-08-07 | Paper |
| Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time | 2013-07-23 | Paper |
| Natural models for evolution on networks | 2013-04-17 | Paper |
| A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs | 2013-01-04 | Paper |
| Parameterized Domination in Circle Graphs | 2012-11-06 | Paper |
| The recognition of triangle graphs | 2012-08-08 | Paper |
| The Recognition of Tolerance and Bounded Tolerance Graphs | 2012-02-11 | Paper |
| The recognition of triangle graphs. | 2012-01-23 | Paper |
| The recognition of tolerance and bounded tolerance graphs. | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3104272 | 2011-12-19 | Paper |
| The longest path problem has a polynomial solution on interval graphs | 2011-09-20 | Paper |
| Vertex splitting and the recognition of trapezoid graphs | 2011-08-10 | Paper |
| Preemptive scheduling of equal-length jobs in polynomial time | 2011-02-19 | Paper |
| An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs | 2011-02-19 | Paper |
| On the Intersection of Tolerance and Cocomparability Graphs | 2010-12-09 | Paper |
| A New Intersection Model and Improved Algorithms for Tolerance Graphs | 2010-12-03 | Paper |
| Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests | 2010-09-07 | Paper |
| Window-games between TCP flows | 2010-07-07 | Paper |
| A New Intersection Model and Improved Algorithms for Tolerance Graphs | 2010-01-21 | Paper |
| The Longest Path Problem Is Polynomial on Interval Graphs | 2009-10-16 | Paper |
| A matrix characterization of interval and proper interval graphs | 2008-04-28 | Paper |
| A polynomial algorithm for the k-cluster problem on the interval graphs | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5486114 | 2006-09-06 | Paper |
