| Publication | Date of Publication | Type |
|---|
A general technique for searching in implicit sets via function inversion
Algorithmica | 2026-05-08 | Paper |
Bounds on the diameter of graph associahedra
Procedia Computer Science | 2025-12-02 | Paper |
Shortest paths on polymatroids and hypergraphic polytopes
Combinatorial Theory | 2025-11-14 | Paper |
Improved algebraic degeneracy testing
Discrete & Computational Geometry | 2025-07-07 | Paper |
Combinatorics of rectangulations: old and new bijections
Combinatorial Theory | 2025-03-27 | Paper |
Inapproximability of shortest paths on perfect matching polytopes
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
Combinatorial generation via permutation languages. IV: Elimination trees
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Improved algebraic degeneracy testing | 2024-10-16 | Paper |
| Efficient generation of elimination trees and graph associahedra | 2024-07-19 | Paper |
| A general technique for searching in implicit sets via function inversion | 2024-05-29 | Paper |
| Zigzagging through acyclic orientations of chordal graphs and hypergraphs | 2024-05-14 | Paper |
| Modular subset sum, dynamic strings, and zero-sum sets | 2024-05-14 | Paper |
The rotation distance of brooms
European Journal of Combinatorics | 2024-03-26 | Paper |
| Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model | 2024-01-15 | Paper |
| Geometric Pattern Matching Reduces to k-SUM. | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7759288 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
Competitive Online Search Trees on Trees
ACM Transactions on Algorithms | 2023-10-23 | Paper |
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
(available as arXiv preprint) | 2023-09-20 | Paper |
Worst-Case Efficient Dynamic Geometric Independent Set
(available as arXiv preprint) | 2023-09-20 | Paper |
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
SIAM Journal on Discrete Mathematics | 2023-08-10 | Paper |
Colouring bottomless rectangles and arborescences
Computational Geometry | 2023-07-31 | Paper |
| Algorithms for approximate sparse regression and nearest induced hulls | 2023-06-05 | Paper |
Drawing graphs as spanners
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
Computational Geometry | 2022-11-16 | Paper |
Diameter estimates for graph associahedra
Annals of Combinatorics | 2022-11-07 | Paper |
Geometric pattern matching reduces to \(k\)-SUM
Discrete & Computational Geometry | 2022-09-16 | Paper |
Drawing graphs as spanners
Discrete & Computational Geometry | 2022-09-16 | Paper |
| Combinatorial generation via permutation languages. IV. Elimination trees | 2021-06-30 | Paper |
Competitive Online Search Trees on Trees
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Flip distances between graph orientations
Algorithmica | 2021-02-01 | Paper |
Subquadratic encodings for point configurations
(available as arXiv preprint) | 2020-08-18 | Paper |
Solving and sampling with many solutions: satisfiability and other hard problems
(available as arXiv preprint) | 2020-05-27 | Paper |
Solving and sampling with many solutions
Algorithmica | 2020-04-01 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Theoretical Computer Science | 2020-01-16 | Paper |
Subquadratic encodings for point configurations
(available as arXiv preprint) | 2020-01-13 | Paper |
Making octants colorful and related covering decomposition problems
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Subquadratic algorithms for algebraic 3SUM
Discrete & Computational Geometry | 2019-05-21 | Paper |
| Decomposition of multiple coverings into more parts | 2019-05-06 | Paper |
Dynamic graph coloring
Algorithmica | 2019-04-25 | Paper |
Finding a maximum-weight convex set in a chordal graph
Journal of Graph Algorithms and Applications | 2019-03-18 | Paper |
| scientific article; zbMATH DE number 7030516 (Why is no real title available?) | 2019-02-27 | Paper |
| Information-theoretic lower bounds for quantum sorting | 2019-02-18 | Paper |
A note on flips in diagonal rectangulations
(available as arXiv preprint) | 2018-12-10 | Paper |
| A note on flips in diagonal rectangulations | 2018-12-10 | Paper |
On the shelling antimatroids of split graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2018-11-26 | Paper |
On the diameter of tree associahedra
The Electronic Journal of Combinatorics | 2018-10-30 | Paper |
On the diameter of tree associahedra
The Electronic Journal of Combinatorics | 2018-10-30 | Paper |
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Intersection graphs of rays and grounded segments
Journal of Graph Algorithms and Applications | 2018-09-06 | Paper |
Subquadratic algorithms for algebraic generalizations of 3SUM
(available as arXiv preprint) | 2018-08-13 | Paper |
Solving k-SUM using few linear queries
(available as arXiv preprint) | 2018-03-02 | Paper |
| Intersection graphs of rays and grounded segments | 2018-01-04 | Paper |
| Recognition and Complexity of Point Visibility Graphs | 2017-10-10 | Paper |
Dynamic graph coloring
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Entropy-Constrained Index Assignments for Multiple Description Quantizers
IEEE Transactions on Signal Processing | 2017-09-08 | Paper |
General position subsets and independent hyperplanes in d-space
Journal of Geometry | 2017-05-22 | Paper |
Reconstructing Point Set Order Types from Radial Orderings
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Making triangles colorful
(available as arXiv preprint) | 2017-03-09 | Paper |
Ramsey-type theorems for lines in 3-space
(available as arXiv preprint) | 2017-03-03 | Paper |
| Ramsey-type theorems for lines in 3-space | 2017-03-03 | Paper |
Recognition and complexity of point visibility graphs
Discrete & Computational Geometry | 2017-02-24 | Paper |
Recognition and complexity of point visibility graphs
Discrete & Computational Geometry | 2017-02-24 | Paper |
Topological Drawings of Complete Bipartite Graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
On the shelling antimatroids of split graphs
Electronic Notes in Discrete Mathematics | 2017-02-14 | Paper |
Covering partial cubes with zones
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Covering partial cubes with zones
Lecture Notes in Computer Science | 2015-09-14 | Paper |
Reconstructing point set order types from radial orderings
Algorithms and Computation | 2015-09-11 | Paper |
Hitting all maximal independent sets of a bipartite graph
Algorithmica | 2015-07-10 | Paper |
The complexity of simultaneous geometric graph embedding
Journal of Graph Algorithms and Applications | 2015-05-18 | Paper |
Making Octants Colorful and Related Covering Decomposition Problems
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
| Cell-paths in mono- and bichromatic line arrangements in the plane | 2015-02-09 | Paper |
An efficient algorithm for partial order production
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Sorting under partial information (without the ellipsoid algorithm)
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
The price of connectivity for vertex cover
(available as arXiv preprint) | 2014-05-02 | Paper |
| The price of connectivity for vertex cover | 2014-05-02 | Paper |
Sorting under partial information (without the ellipsoid algorithm).
Combinatorica | 2014-03-17 | Paper |
scientific article; zbMATH DE number 6257577 (Why is no real title available?)
(available as arXiv preprint) | 2014-02-14 | Paper |
| scientific article; zbMATH DE number 6257577 (Why is no real title available?) | 2014-02-14 | Paper |
Draining a polygon-or-rolling a ball out of a polygon
Computational Geometry | 2014-01-22 | Paper |
On universal point sets for planar graphs
Computational Geometry and Graphs | 2013-12-06 | Paper |
The clique problem in ray intersection graphs
Discrete & Computational Geometry | 2013-11-06 | Paper |
Helly numbers of polyominoes
Graphs and Combinatorics | 2013-09-26 | Paper |
On generalized comparison-based sorting problems
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Coloring planar homothets and three-dimensional hypergraphs
Computational Geometry | 2013-09-03 | Paper |
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Approximating subdense instances of covering problems
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Journal of Combinatorial Optimization | 2013-04-08 | Paper |
Minimum entropy combinatorial optimization problems
Theory of Computing Systems | 2012-12-07 | Paper |
Non-crossing matchings of points with geometric objects
Computational Geometry | 2012-10-12 | Paper |
The Clique Problem in Ray Intersection Graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Approximating vertex cover in dense hypergraphs
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Coloring Planar Homothets and Three-Dimensional Hypergraphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Algorithmic folding complexity
Graphs and Combinatorics | 2012-01-24 | Paper |
Colorful strips
Graphs and Combinatorics | 2012-01-24 | Paper |
An efficient algorithm for partial order production
SIAM Journal on Computing | 2011-04-04 | Paper |
The Stackelberg minimum spanning tree game
Algorithmica | 2011-03-02 | Paper |
Decomposition of multiple coverings into more parts
Discrete & Computational Geometry | 2010-11-08 | Paper |
Minimum sum edge colorings of multicycles
Discrete Applied Mathematics | 2010-08-13 | Paper |
| Randomized optimization: a probabilistic analysis | 2010-08-02 | Paper |
Minimum entropy combinatorial optimization problems
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Connected vertex covers in dense graphs
Theoretical Computer Science | 2010-06-07 | Paper |
Matching points with things
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Colorful strips
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Non-cooperative facility location and covering games
Theoretical Computer Science | 2010-04-15 | Paper |
Pricing geometric transportation networks
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
Algorithmic folding complexity
Algorithms and Computation | 2009-12-17 | Paper |
Highway hull revisited
Computational Geometry | 2009-11-16 | Paper |
Coloring geometric range spaces
Discrete & Computational Geometry | 2009-05-13 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Minimum entropy coloring
Journal of Combinatorial Optimization | 2009-05-04 | Paper |
Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science | 2009-03-17 | Paper |
The Stackelberg Minimum Spanning Tree Game
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Empty region graphs
Computational Geometry | 2009-02-12 | Paper |
Minimum entropy orientations
Operations Research Letters | 2009-01-09 | Paper |
Reconciliation of a Quantum-Distributed Gaussian Key
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Connected Vertex Covers in Dense Graphs
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Optimal location of transportation devices
Computational Geometry | 2008-09-19 | Paper |
Chromatic Edge Strength of Some Multigraphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Tight results on minimum entropy set cover
Algorithmica | 2008-05-27 | Paper |
Coloring Geometric Range Spaces
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
Approximation and Online Algorithms | 2008-02-21 | Paper |
Local properties of geometric graphs
Computational Geometry | 2007-10-19 | Paper |
Tight Results on Minimum Entropy Set Cover
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Juggling with pattern matching
Theory of Computing Systems | 2007-02-13 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Designing small keyboards is hard
Theoretical Computer Science | 2005-04-06 | Paper |
Fast fractal compression of greyscale images
IEEE Transactions on Image Processing | 2003-10-15 | Paper |
Tree-structured multiple description coding
Journal of VLSI signal processing systems for signal, image and video technology | 2003-08-25 | Paper |
Complexity-constrained tree-structured vector quantizers
Signal Processing | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1488149 (Why is no real title available?) | 2001-04-26 | Paper |
Combinatorics of rectangulations: Old and new bijections
(available as arXiv preprint) | N/A | Paper |
The expansion of half-integral polytopes
(available as arXiv preprint) | N/A | Paper |
