| Publication | Date of Publication | Type |
|---|
The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
On the reconfiguration of chains
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
International Journal of Foundations of Computer Science | 2023-11-16 | Paper |
The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs
Lecture Notes in Computer Science | 2023-08-10 | Paper |
1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
Journal of Graph Algorithms and Applications | 2023-07-03 | Paper |
Combinatorial properties and recognition of unit square visibility graphs
Discrete & Computational Geometry | 2023-05-12 | Paper |
Nearest neighbour graph realizability is NP-hard
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids
| 2022-07-13 | Paper |
Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
| 2022-03-22 | Paper |
Combinatorial properties and recognition of unit square visibility graphs
| 2020-05-26 | Paper |
Reconfiguring Hamiltonian cycles in L-shaped grid graphs
| 2020-02-24 | Paper |
Monotone simultaneous paths embeddings in \(\mathbb{R}^d\)
| 2018-12-10 | Paper |
Kinetic \(k\)-semi-Yao graph and its applications
Computational Geometry | 2018-11-19 | Paper |
Visibility representations of boxes in 2.5 dimensions
Computational Geometry | 2018-10-31 | Paper |
On the planar split thickness of graphs
Algorithmica | 2018-04-11 | Paper |
Connecting a set of circles with minimum sum of radii
Computational Geometry | 2018-02-19 | Paper |
Bend complexity and Hamiltonian cycles in grid graphs
| 2017-10-23 | Paper |
Connectivity graphs of uncertainty regions
Algorithmica | 2017-10-09 | Paper |
The complexity of (un)folding
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
The number of lines tangent to arbitrary convex polyhedra in 3D
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Separating point sets in polygonal environments
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Monotone simultaneous embeddings of paths in \(d\) dimensions
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Visibility representations of boxes in 2.5 dimensions
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Constrained light deployment for reducing energy consumption in buildings
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the planar split thickness of graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Discrete mathematics for computer science. With CD-ROM
| 2016-01-26 | Paper |
Kinetic reverse \(k\)-nearest neighbor problem
Lecture Notes in Computer Science | 2015-09-15 | Paper |
A simple, faster method for kinetic proximity problems
Computational Geometry | 2015-05-12 | Paper |
Kinetic data structures for all nearest neighbors and closest pair in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Computing upward topological book embeddings of upward planar digraphs
Journal of Discrete Algorithms | 2015-02-13 | Paper |
Acyclic coloring with few division vertices
Lecture Notes in Computer Science | 2014-08-19 | Paper |
Acyclic coloring with few division vertices
Journal of Discrete Algorithms | 2014-08-13 | Paper |
A note on minimum-segment drawings of planar graphs
Journal of Graph Algorithms and Applications | 2013-07-09 | Paper |
On representing graphs by touching cuboids
Graph Drawing | 2013-04-03 | Paper |
Kinetic and Stationary Point-Set Embeddability for Plane Graphs
Graph Drawing | 2013-04-03 | Paper |
Acyclic colorings of graph subdivisions revisited
Journal of Discrete Algorithms | 2013-01-18 | Paper |
On three-dimensional graph drawing and embedding
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
The shape of orthogonal cycles in three dimensions
Discrete & Computational Geometry | 2012-04-04 | Paper |
Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\)
Graph Drawing | 2012-03-09 | Paper |
Acyclic colorings of graph subdivisions
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Connecting a set of circles with minimum sum of radii
Lecture Notes in Computer Science | 2011-08-12 | Paper |
A succinct 3D visibility skeleton
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
Connectivity graphs of uncertainty regions
Lecture Notes in Computer Science | 2010-12-09 | Paper |
Milling a graph with turn costs: a parameterized complexity perspective
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
On the Computation of 3D Visibility Skeletons
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Intractability in graph drawing and geometry: FPT approaches
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Embeddability Problems for Upward Planar Digraphs
Graph Drawing | 2009-03-03 | Paper |
On the parameterized complexity of layered graph drawing
Algorithmica | 2008-12-02 | Paper |
Faster fixed-parameter tractable algorithms for matching and packing problems
Algorithmica | 2008-12-02 | Paper |
Realizing partitions respecting full and partial order information
Journal of Discrete Algorithms | 2008-11-18 | Paper |
MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT
International Journal of Computational Geometry & Applications | 2008-05-14 | Paper |
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing | 2008-04-22 | Paper |
The strength of weak proximity
Journal of Discrete Algorithms | 2006-10-31 | Paper |
A fixed-parameter approach to 2-layer planarization
Algorithmica | 2006-08-11 | Paper |
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Transversals to line segments in three-dimensional space
Discrete & Computational Geometry | 2005-11-10 | Paper |
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
International Journal of Computational Geometry & Applications | 2005-09-29 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
scientific article; zbMATH DE number 2145225 (Why is no real title available?)
| 2005-03-14 | Paper |
A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
Algorithmica | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2084262 (Why is no real title available?)
| 2004-08-06 | Paper |
scientific article; zbMATH DE number 2080106 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080974 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 1974113 (Why is no real title available?)
| 2003-09-03 | Paper |
scientific article; zbMATH DE number 1962799 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1875438 (Why is no real title available?)
| 2003-03-02 | Paper |
Embedding problems for paths with direction constrained edges.
Theoretical Computer Science | 2003-01-21 | Paper |
Curvature-Constrained Shortest Paths in a Convex Polygon
SIAM Journal on Computing | 2003-01-05 | Paper |
On validating planar worlds
| 2002-07-22 | Paper |
Locked and unlocked polygonal chains in three dimensions
Discrete & Computational Geometry | 2002-07-22 | Paper |
scientific article; zbMATH DE number 1696623 (Why is no real title available?)
| 2002-07-22 | Paper |
A note on reconfiguring tree linkages: Trees can lock
Discrete Applied Mathematics | 2002-05-15 | Paper |
Three-dimensional orthogonal graph drawing algorithms
Discrete Applied Mathematics | 2000-07-11 | Paper |
The largest \(k\)-ball in a \(d\)-dimensional box
Computational Geometry | 1998-12-21 | Paper |
A Visibility Representation for Graphs in Three Dimensions
Journal of Graph Algorithms and Applications | 1998-07-05 | Paper |
The rectangle of influence drawability problem
Computational Geometry | 1998-06-08 | Paper |
Localizing a Robot with Minimum Travel
SIAM Journal on Computing | 1998-05-10 | Paper |
Universal 3-dimensional visibility representations for graphs
Computational Geometry | 1998-04-13 | Paper |
Simultaneous dominance representation of multiple posets
Order | 1997-08-05 | Paper |
The logic engine and the realization problem for nearest neighbor graphs
Theoretical Computer Science | 1997-02-27 | Paper |
The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
Information Processing Letters | 1997-02-27 | Paper |
The realization problem for Euclidean minimum spanning trees is NP-hard
Algorithmica | 1996-11-10 | Paper |
scientific article; zbMATH DE number 910901 (Why is no real title available?)
| 1996-11-04 | Paper |
Folding rulers inside triangles
Discrete & Computational Geometry | 1996-09-22 | Paper |
Reconfiguring closed polygonal chains in Euclidean \(d\)-space
Discrete & Computational Geometry | 1995-03-20 | Paper |
Drawing graphs in two layers
Theoretical Computer Science | 1994-08-29 | Paper |
Grid intersection graphs and boxicity
Discrete Mathematics | 1993-10-24 | Paper |
Computing the link center of a simple polygon
Discrete & Computational Geometry | 1988-01-01 | Paper |
On the Movement of Robot Arms in 2-Dimensional Bounded Regions
SIAM Journal on Computing | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3945381 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3967290 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3908479 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3893228 (Why is no real title available?)
| 1984-01-01 | Paper |
Movement Problems for 2-Dimensional Linkages
SIAM Journal on Computing | 1984-01-01 | Paper |
Edge-colored complete graphs with alternating cycles
Discrete Mathematics | 1983-01-01 | Paper |
A classification of certain graphs with minimal imperfection properties
Discrete Mathematics | 1982-01-01 | Paper |
An algorithm for finding clique cut-sets
Information Processing Letters | 1981-01-01 | Paper |
Collineations of projective planes of order 10. Part I
Journal of Combinatorial Theory. Series A | 1979-01-01 | Paper |
Collineations of projective planes of order 10, part II
Journal of Combinatorial Theory. Series A | 1979-01-01 | Paper |
A note on a generalized regularity condition
Lecture Notes in Mathematics | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3528251 (Why is no real title available?)
| 1976-01-01 | Paper |
