| Publication | Date of Publication | Type |
|---|
Dushnik-Miller dimension of stair contact complexes
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Contact graphs of boxes with unidirectional contacts
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
KK-duality for self-similar groupoid actions on graphs
| 2023-02-08 | Paper |
Complexity of some arc-partition problems for digraphs
Theoretical Computer Science | 2022-10-07 | Paper |
On Comparable Box Dimension
| 2022-03-15 | Paper |
Avoiding large squares in trees and planar graphs
| 2021-06-02 | Paper |
Every collinear set in a planar graph is free
Discrete \& Computational Geometry | 2021-04-29 | Paper |
Not all planar graphs are in PURE-4-DIR
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
Dushnik-Miller dimension of TD-Delaunay complexes
European Journal of Combinatorics | 2020-06-16 | Paper |
On independent set in \(B_1\)-EPG graphs
Discrete Applied Mathematics | 2020-04-21 | Paper |
3-colorable planar graphs have an intersection segment representation using 3 slopes
| 2020-02-24 | Paper |
Acyclic coloring of graphs and entropy compression method
Discrete Mathematics | 2020-02-20 | Paper |
Homothetic triangle representations of planar graphs
Journal of Graph Algorithms and Applications | 2019-10-25 | Paper |
Every collinear set in a planar graph is free
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the structure of Schnyder woods on orientable surfaces
| 2019-07-23 | Paper |
On triangles in \(K_r\)-minor free graphs
Journal of Graph Theory | 2018-07-13 | Paper |
scientific article; zbMATH DE number 6850320 (Why is no real title available?)
| 2018-03-15 | Paper |
Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes
| 2018-01-18 | Paper |
The \(k\)-strong induced arboricity of a graph
European Journal of Combinatorics | 2017-10-10 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Encoding toroidal triangulations
Discrete \& Computational Geometry | 2017-05-11 | Paper |
Coloring non-crossing strings
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
Orienting triangulations
Journal of Graph Theory | 2016-11-17 | Paper |
On independent set on B1-EPG graphs
Approximation and Online Algorithms | 2016-02-26 | Paper |
Detecting minors in matroids through triangles
European Journal of Combinatorics | 2015-12-23 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Lecture Notes in Computer Science | 2015-10-20 | Paper |
The maximum clique problem in multiple interval graphs
Algorithmica | 2015-06-25 | Paper |
Every planar graph is the intersection graph of segments in the plane (extended abstract)
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Two-floor buildings need eight colors
Journal of Graph Algorithms and Applications | 2015-01-27 | Paper |
scientific article; zbMATH DE number 6381690 (Why is no real title available?)
| 2014-12-18 | Paper |
Entropy compression method applied to graph colorings
| 2014-06-17 | Paper |
Locally identifying coloring in bounded expansion classes of graphs
Discrete Applied Mathematics | 2014-04-23 | Paper |
Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations
Discrete \& Computational Geometry | 2014-03-25 | Paper |
Parameterized domination in circle graphs
Theory of Computing Systems | 2014-03-25 | Paper |
On exact algorithms for the permutation CSP
Theoretical Computer Science | 2014-01-13 | Paper |
Coloring a set of touching strings
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Spanning galaxies in digraphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties
Theoretical Computer Science | 2013-03-04 | Paper |
The maximum clique problem in multiple interval graphs (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Parameterized Domination in Circle Graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Triangle contact representations and duality
Discrete \& Computational Geometry | 2012-08-13 | Paper |
On spanning galaxies in digraphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
The domination number of grids
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Triangle Contact Representations and Duality
Graph Drawing | 2011-02-11 | Paper |
Edge partition of planar sraphs into two outerplanar graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5763163 (Why is no real title available?)
| 2010-07-30 | Paper |
Diamond-free circle graphs are Helly circle
Discrete Mathematics | 2010-04-27 | Paper |
Planar graphs have 1-string representations
Discrete \& Computational Geometry | 2010-04-12 | Paper |
On star and caterpillar arboricity
Discrete Mathematics | 2009-06-19 | Paper |
Covering planar graphs with forests, one having bounded maximum degree
Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
A planar linear hypergraph whose edges cannot be represented as straight line segments
European Journal of Combinatorics | 2009-01-27 | Paper |
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
Discrete Optimization | 2008-05-14 | Paper |
On the \(L(p,1)\)-labelling of graphs
Discrete Mathematics | 2008-03-18 | Paper |
Caterpillar arboricity of planar graphs
Discrete Mathematics | 2007-06-26 | Paper |
On some arboricities in planar graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Contact graphs of boxes with unidirectional contacts
| N/A | Paper |
Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture
| N/A | Paper |
Brooks-type colourings of digraphs in linear time
| N/A | Paper |
