| 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
Journal of Computer and System Sciences | 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
Lecture Notes in Computer Science | 2024-01-16 | Paper |
On reachable assignments under dichotomous preferences
Theoretical Computer Science | 2023-10-26 | Paper |
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
ACM Transactions on Algorithms | 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
Theoretical Computer Science | 2023-01-05 | Paper |
Linear-time recognition of double-threshold graphs
Graph-Theoretic Concepts in Computer Science | 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
Operations Research Letters | 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
Discrete Optimization | 2022-06-09 | Paper |
Weight balancing on boundaries
| 2022-05-18 | Paper |
scientific article; zbMATH DE number 7525498 (Why is no real title available?)
| 2022-05-11 | Paper |
Shortest reconfiguration of perfect matchings via alternating cycles
SIAM Journal on Discrete Mathematics | 2022-05-10 | Paper |
Linear-time recognition of double-threshold graphs
Algorithmica | 2022-03-22 | Paper |
Algorithmic enumeration of surrounding polygons
Discrete Applied Mathematics | 2021-09-15 | Paper |
Angular Resolutions: Around Vertices and Crossings
Beyond Planar Graphs | 2021-07-22 | Paper |
Algorithms for gerrymandering over graphs
Theoretical Computer Science | 2021-05-10 | Paper |
Rectilinear link diameter and radius in a rectilinear polygonal domain
Computational Geometry | 2021-01-07 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Algorithmica | 2020-11-11 | Paper |
Variants of the segment number of a graph
| 2020-10-26 | Paper |
Graphs with large total angular resolution
Lecture Notes in Computer Science | 2020-10-26 | Paper |
Exact algorithms for the max-min dispersion problem
| 2020-07-07 | Paper |
Balanced line separators of unit disk graphs
Computational Geometry | 2020-04-22 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Area bounds of rectilinear polygons realized by angle sequences
Computational Geometry | 2019-10-25 | Paper |
Linear-Time Recognition of Double-Threshold Graphs
| 2019-09-20 | Paper |
Reconfiguration of maximum-weight \(b\)-matchings in a graph
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
Sequentially swapping colored tokens on graphs
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Minimum-cost \(b\)-edge dominating sets on trees
Algorithmica | 2019-01-11 | Paper |
Computing the geodesic centers of a polygonal domain
Computational Geometry | 2018-11-19 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Computational complexity of robot arm simulation problems
| 2018-09-06 | Paper |
Folding free-space diagrams: computing the Fréchet distance between 1-dimensional curves
| 2018-08-13 | Paper |
Submodularity of minimum-cost spanning tree games
Networks | 2018-05-23 | Paper |
Weight Balancing on Boundaries and Skeletons
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Free edge lengths in plane graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Approximation and hardness of token swapping
| 2018-03-02 | Paper |
Computing the \(L_1\) 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
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Efficient stabilization of cooperative matching games
Theoretical Computer Science | 2017-05-15 | Paper |
Computing the \(L_1\) geodesic diameter and center of a polygonal domain
Discrete \& Computational Geometry | 2017-05-11 | Paper |
Sequentially swapping colored tokens on graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Extended formulations for sparsity matroids
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
Computational Geometry | 2016-01-18 | Paper |
On the treewidth of toroidal grids
Discrete Applied Mathematics | 2015-12-07 | Paper |
Minimum-cost \(b\)-edge dominating sets on trees
Algorithms and Computation | 2015-09-11 | Paper |
Free edge lengths in plane graphs
Discrete \& Computational Geometry | 2015-07-20 | Paper |
Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
Computational Geometry | 2015-06-17 | Paper |
Swapping labeled tokens on graphs
Theoretical Computer Science | 2015-05-26 | Paper |
A 4.31-approximation for the geometric unique coverage problem on unit disks
Theoretical Computer Science | 2014-07-07 | Paper |
Approximating the path-distance-width for AT-free graphs and graphs in related classes
Discrete Applied Mathematics | 2014-04-02 | Paper |
Semantic word cloud representations: hardness and approximation algorithms
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
On bipartite powers of bigraphs
| 2014-03-25 | Paper |
The complexity of the stamp folding problem
Theoretical Computer Science | 2014-01-10 | Paper |
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
The geodesic diameter of polygonal domains
Discrete \& Computational Geometry | 2013-09-23 | Paper |
Universal point subsets for planar graphs
Algorithms and Computation | 2013-03-21 | Paper |
A 4.31-approximation for the geometric unique coverage problem on unit disks
Algorithms and Computation | 2013-03-21 | Paper |
Area Bounds of Rectilinear Polygons Realized by Angle Sequences
Algorithms and Computation | 2013-03-21 | Paper |
Vertex angle and crossing angle resolution of leveled tree drawings
Information Processing Letters | 2012-10-23 | Paper |
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Querying two boundary points for shortest paths in a polygonal domain
Computational Geometry | 2012-05-18 | Paper |
Drawing (complete) binary tanglegrams
Algorithmica | 2012-04-26 | Paper |
Approximability of the path-distance-width for AT-free graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Not All Saturated 3-Forests Are Tight
| 2011-09-15 | Paper |
Dominating Set Counting in Graph Classes
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
Lecture Notes in Computer Science | 2011-07-01 | Paper |
A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
European Journal of Operational Research | 2011-03-22 | Paper |
Matroid representation of clique complexes
Lecture Notes in Computer Science | 2011-03-18 | Paper |
A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Adaptive algorithms for planar convex hull problems
Frontiers in Algorithmics | 2010-09-07 | Paper |
The geodesic diameter of polygonal domains
Algorithms – ESA 2010 | 2010-09-06 | Paper |
On listing, sampling, and counting the chordal graphs with edge constraints
Theoretical Computer Science | 2010-06-07 | Paper |
Counting the number of matchings in chordal and chordal bipartite graph classes
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Querying two boundary points for shortest paths in a polygonal domain (extended abstract)
Algorithms and Computation | 2009-12-17 | Paper |
Untangling a planar graph
Discrete \& Computational Geometry | 2009-12-14 | Paper |
The Holt-Klee condition for oriented matroids
European Journal of Combinatorics | 2009-12-03 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
Drawing (Complete) Binary Tanglegrams
Graph Drawing | 2009-03-03 | Paper |
Counting the number of independent sets in chordal graphs
Journal of Discrete Algorithms | 2008-08-08 | Paper |
Local topology of the free complex of a two-dimensional generalized convex shelling
Discrete Mathematics | 2008-07-11 | Paper |
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Core Stability of Minimum Coloring Games
Mathematics of Operations Research | 2008-05-27 | Paper |
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
Algorithms and Computation | 2008-05-27 | Paper |
Fair cost allocations under conflicts - a game-theoretic point of view -
Discrete Optimization | 2008-05-16 | Paper |
Moving Vertices to Make Drawings Plane
Graph Drawing | 2008-03-25 | Paper |
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
Discrete Applied Mathematics | 2007-10-29 | Paper |
Matroid representation of clique complexes
Discrete Applied Mathematics | 2007-09-19 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
The affine representation theorem for abstract convex geometries
Computational Geometry | 2005-01-31 | Paper |
Traveling salesman games with the Monge property
Discrete Applied Mathematics | 2004-08-06 | Paper |
Submodularity of some classes of the combinatorial optimization games
Mathematical Methods of Operations Research | 2004-03-07 | Paper |
A greedy algorithm for convex geometries
Discrete Applied Mathematics | 2003-10-14 | Paper |
The forbidden minor characterization of line-search antimatroids of rooted digraphs
Discrete Applied Mathematics | 2003-10-14 | Paper |
Some properties of the core on convex geometries
Mathematical Methods of Operations Research | 2003-06-23 | Paper |
scientific article; zbMATH DE number 1842039 (Why is no real title available?)
| 2002-12-04 | Paper |
A greedy algorithm for convex geometry
RIMS Kokyuroku | 2001-09-23 | Paper |
