| Publication | Date of Publication | Type |
|---|
| Rerouting planar curves and disjoint paths | 2024-11-14 | Paper |
| Hardness of finding combinatorial shortest paths on graph associahedra | 2024-11-14 | Paper |
| Reconfiguration of colorings in triangulations of the sphere | 2024-10-16 | Paper |
| Minimum separator reconfiguration | 2024-10-08 | Paper |
| Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams | 2024-07-19 | Paper |
| Unlabeled multi-robot motion planning with tighter separation bounds | 2024-05-14 | Paper |
| Algorithmic theory of qubit routing | 2024-01-16 | Paper |
| On reachable assignments under dichotomous preferences | 2023-10-26 | Paper |
| Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams | 2023-10-23 | Paper |
| Minimum Separator Reconfiguration | 2023-07-15 | Paper |
| Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra | 2023-04-28 | Paper |
| Graphs with large total angular resolution | 2023-01-05 | Paper |
| Linear-time recognition of double-threshold graphs | 2022-12-21 | Paper |
| Reconfiguration of colorings in triangulations of the sphere | 2022-10-31 | Paper |
| Rerouting Planar Curves and Disjoint Paths | 2022-10-21 | Paper |
| A parameterized view to the robust recoverable base problem of matroids under structural uncertainty | 2022-07-22 | Paper |
| Rectilinear link diameter and radius in a rectilinear polygonal domain | 2022-07-21 | Paper |
| Reforming an Envy-Free Matching | 2022-07-06 | Paper |
| Submodular reassignment problem for reallocating agents to tasks with synergy effects | 2022-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077652 | 2022-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075806 | 2022-05-11 | Paper |
| Shortest Reconfiguration of Perfect Matchings via Alternating Cycles | 2022-05-10 | Paper |
| Linear-time recognition of double-threshold graphs | 2022-03-22 | Paper |
| Algorithmic enumeration of surrounding polygons | 2021-09-15 | Paper |
| Angular Resolutions: Around Vertices and Crossings | 2021-07-22 | Paper |
| Algorithms for gerrymandering over graphs | 2021-05-10 | Paper |
| Rectilinear link diameter and radius in a rectilinear polygonal domain | 2021-01-07 | Paper |
| Subgraph isomorphism on graph classes that exclude a substructure | 2020-11-11 | Paper |
| Variants of the segment number of a graph | 2020-10-26 | Paper |
| Graphs with large total angular resolution | 2020-10-26 | Paper |
| Exact algorithms for the max-min dispersion problem | 2020-07-07 | Paper |
| Balanced line separators of unit disk graphs | 2020-04-22 | Paper |
| Subgraph isomorphism on graph classes that exclude a substructure | 2020-02-06 | Paper |
| Area bounds of rectilinear polygons realized by angle sequences | 2019-10-25 | Paper |
| Linear-Time Recognition of Double-Threshold Graphs | 2019-09-20 | Paper |
| Reconfiguration of maximum-weight \(b\)-matchings in a graph | 2019-06-06 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2019-02-14 | Paper |
| Minimum-cost \(b\)-edge dominating sets on trees | 2019-01-11 | Paper |
| Computing the geodesic centers of a polygonal domain | 2018-11-19 | Paper |
| On Problems as Hard as CNF-SAT | 2018-11-05 | Paper |
| Computational complexity of robot arm simulation problems | 2018-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580143 | 2018-08-13 | Paper |
| Submodularity of minimum-cost spanning tree games | 2018-05-23 | Paper |
| Weight Balancing on Boundaries and Skeletons | 2018-04-23 | Paper |
| Free Edge Lengths in Plane Graphs | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606338 | 2018-03-02 | Paper |
| Computing the L1 Geodesic Diameter and Center of a Polygonal Domain | 2018-01-24 | Paper |
| Reconfiguration of maximum weight \(b\)-matchings in a graph | 2017-10-23 | Paper |
| Balanced line separators of unit disk graphs | 2017-09-22 | Paper |
| Efficient stabilization of cooperative matching games | 2017-05-15 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a polygonal domain | 2017-05-11 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2017-05-05 | Paper |
| Extended formulations for sparsity matroids | 2016-08-25 | Paper |
| A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | 2016-01-18 | Paper |
| On the treewidth of toroidal grids | 2015-12-07 | Paper |
| Minimum-Cost $$b$$-Edge Dominating Sets on Trees | 2015-09-11 | Paper |
| Free edge lengths in plane graphs | 2015-07-20 | Paper |
| Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time | 2015-06-17 | Paper |
| Swapping labeled tokens on graphs | 2015-05-26 | Paper |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2014-07-07 | Paper |
| Approximating the path-distance-width for AT-free graphs and graphs in related classes | 2014-04-02 | Paper |
| Semantic Word Cloud Representations: Hardness and Approximation Algorithms | 2014-03-31 | Paper |
| Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time | 2014-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403023 | 2014-03-25 | Paper |
| The complexity of the stamp folding problem | 2014-01-10 | Paper |
| Hardness results and an exact exponential algorithm for the spanning tree congestion problem | 2013-11-28 | Paper |
| The geodesic diameter of polygonal domains | 2013-09-23 | Paper |
| Universal Point Subsets for Planar Graphs | 2013-03-21 | Paper |
| A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks | 2013-03-21 | Paper |
| Area Bounds of Rectilinear Polygons Realized by Angle Sequences | 2013-03-21 | Paper |
| Vertex angle and crossing angle resolution of leveled tree drawings | 2012-10-23 | Paper |
| A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares | 2012-08-14 | Paper |
| Querying two boundary points for shortest paths in a polygonal domain | 2012-05-18 | Paper |
| Drawing (complete) binary tanglegrams | 2012-04-26 | Paper |
| Approximability of the Path-Distance-Width for AT-free Graphs | 2011-12-16 | Paper |
| Not All Saturated 3-Forests Are Tight | 2011-09-15 | Paper |
| Dominating Set Counting in Graph Classes | 2011-08-17 | Paper |
| Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem | 2011-07-01 | Paper |
| A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization | 2011-03-22 | Paper |
| Matroid Representation of Clique Complexes | 2011-03-18 | Paper |
| A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets | 2010-12-16 | Paper |
| Adaptive Algorithms for Planar Convex Hull Problems | 2010-09-07 | Paper |
| The Geodesic Diameter of Polygonal Domains | 2010-09-06 | Paper |
| On listing, sampling, and counting the chordal graphs with edge constraints | 2010-06-07 | Paper |
| Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes | 2010-01-21 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Querying Two Boundary Points for Shortest Paths in a Polygonal Domain | 2009-12-17 | Paper |
| Untangling a planar graph | 2009-12-14 | Paper |
| The Holt-Klee condition for oriented matroids | 2009-12-03 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES | 2009-04-14 | Paper |
| Drawing (Complete) Binary Tanglegrams | 2009-03-03 | Paper |
| Counting the number of independent sets in chordal graphs | 2008-08-08 | Paper |
| Local topology of the free complex of a two-dimensional generalized convex shelling | 2008-07-11 | Paper |
| On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints | 2008-07-10 | Paper |
| Core Stability of Minimum Coloring Games | 2008-05-27 | Paper |
| A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization | 2008-05-27 | Paper |
| Fair cost allocations under conflicts - a game-theoretic point of view - | 2008-05-16 | Paper |
| Moving Vertices to Make Drawings Plane | 2008-03-25 | Paper |
| Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs | 2007-10-29 | Paper |
| Matroid representation of clique complexes | 2007-09-19 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| The affine representation theorem for abstract convex geometries | 2005-01-31 | Paper |
| Traveling salesman games with the Monge property | 2004-08-06 | Paper |
| Submodularity of some classes of the combinatorial optimization games | 2004-03-07 | Paper |
| A greedy algorithm for convex geometries | 2003-10-14 | Paper |
| The forbidden minor characterization of line-search antimatroids of rooted digraphs | 2003-10-14 | Paper |
| Some properties of the core on convex geometries | 2003-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783558 | 2002-12-04 | Paper |
| A greedy algorithm for convex geometry | 2001-09-23 | Paper |
