| Publication | Date of Publication | Type |
|---|
On the pebbling numbers of flower, Blanuša and Watkins snarks
Discrete Applied Mathematics | 2025-01-06 | Paper |
Canonical cuts of path powers
Contributions to Discrete Mathematics | 2024-11-20 | Paper |
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
Networks | 2024-09-05 | Paper |
On the total chromatic number of the direct product of cycles and complete graphs
RAIRO. Operations Research | 2024-06-05 | Paper |
| Pebbling in Kneser graphs | 2024-05-31 | Paper |
Coloring game and maximum vertex degree restriction
Matemática Contemporânea | 2024-05-24 | Paper |
On the pebbling numbers of some snarks
Matemática Contemporânea | 2024-05-24 | Paper |
A linear algorithm for the distance in Cayley graph \(H_{\ell,p}\)
Matemática Contemporânea | 2024-04-25 | Paper |
An optimal algorithm to totally color some powers of cycle graphs
Matemática Contemporânea | 2024-04-25 | Paper |
On the diameter of the Cayley graph \(H_{\ell,p}\)
Matemática Contemporânea | 2024-04-22 | Paper |
Sorting separable permutations by restricted multi-break rearrangements
Matemática Contemporânea | 2024-04-22 | Paper |
Timber game with caterpillars
Matemática Contemporânea | 2024-04-22 | Paper |
Bounds and complexity for the tessellation problem
Matemática Contemporânea | 2024-04-22 | Paper |
Connecting terminals using at most one router
Matemática Contemporânea | 2024-04-22 | Paper |
Short block-move-CPP is \textsf{NP}-complete
Matemática Contemporânea | 2024-04-22 | Paper |
Maximum cut on interval graphs of interval count four is NP-complete
Discrete & Computational Geometry | 2024-04-02 | Paper |
On the degree of trees with game chromatic number 4
RAIRO - Operations Research | 2024-01-22 | Paper |
On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems
Networks | 2023-12-11 | Paper |
MaxCut on permutation graphs is NP‐complete
Journal of Graph Theory | 2023-10-10 | Paper |
scientific article; zbMATH DE number 7724211 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
On the computational difficulty of the terminal connection problem
RAIRO - Theoretical Informatics and Applications | 2023-05-25 | Paper |
| Total colouring | 2022-12-21 | Paper |
On total and edge coloring some Kneser graphs
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
On edge-colouring indifference graphs
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
| Even-power of cycles with many vertices are type 1 total colorable | 2022-04-27 | Paper |
| On caterpillars of game chromatic number 4 | 2022-04-27 | Paper |
| A general method for forbidden induced subgraph sandwich problem NP-completeness | 2022-04-27 | Paper |
| On the terminal connection problem | 2022-03-24 | Paper |
Computing the zig-zag number of directed graphs
Discrete Applied Mathematics | 2022-03-24 | Paper |
| Most direct product of graphs are Type 1 | 2021-10-27 | Paper |
Complexity-separating graph classes for vertex, edge and total colouring
Discrete Applied Mathematics | 2020-05-29 | Paper |
| Total tessellation cover and quantum walk | 2020-02-20 | Paper |
On the computational complexity of closest genome problems
Discrete Applied Mathematics | 2020-02-14 | Paper |
| The Tessellation Cover Number of Good Tessellable Graphs | 2019-08-28 | Paper |
Timber game as a counting problem
Discrete Applied Mathematics | 2019-05-17 | Paper |
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers
Discrete Mathematics | 2019-03-25 | Paper |
On the embedding of cone graphs in the line with distinct distances between neighbors
Discrete Applied Mathematics | 2019-02-21 | Paper |
Sandwich and probe problems for excluding paths
Discrete Applied Mathematics | 2018-12-03 | Paper |
The sandwich problem for decompositions and almost monotone properties
Algorithmica | 2018-10-18 | Paper |
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
Discrete Applied Mathematics | 2018-05-24 | Paper |
The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
Discrete Applied Mathematics | 2017-12-20 | Paper |
Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
Algorithmica | 2017-04-12 | Paper |
Linear-time graph distance and diameter approximation
International Transactions in Operational Research | 2016-10-21 | Paper |
| Using SPQR-trees to speed up algorithms based on 2-cutset decompositions | 2016-10-17 | Paper |
The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
Journal of Graph Theory | 2016-10-13 | Paper |
| The graph sandwich problem for 1-join composition is NP-complete | 2016-07-01 | Paper |
The cost of perfection for matchings in graphs
Discrete Applied Mathematics | 2016-06-22 | Paper |
On the equitable total chromatic number of cubic graphs
Discrete Applied Mathematics | 2016-06-21 | Paper |
Total-chromatic number and chromatic index of dually chordal graphs
Information Processing Letters | 2016-06-16 | Paper |
The homogeneous set sandwich problem
Information Processing Letters | 2016-06-09 | Paper |
On the total coloring of generalized Petersen graphs
Discrete Mathematics | 2016-04-07 | Paper |
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
Theoretical Computer Science | 2016-02-18 | Paper |
The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy
Information Processing Letters | 2016-01-05 | Paper |
Linear-time approximation algorithms for unit disk graphs
Approximation and Online Algorithms | 2015-11-20 | Paper |
Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
Discrete Applied Mathematics | 2015-09-22 | Paper |
| Two families of Cayley graph interconnection networks | 2015-04-09 | Paper |
| Total chromatic number of some families of graphs with maximum degree 3 | 2015-04-09 | Paper |
| Searching for a NP-complete probe graph problem | 2015-04-09 | Paper |
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
Discrete Applied Mathematics | 2015-02-06 | Paper |
Blind-friendly von Neumann's heads or tails
The American Mathematical Monthly | 2015-02-02 | Paper |
The hunting of a snark with total chromatic number 5
Discrete Applied Mathematics | 2014-05-05 | Paper |
Advancing the transposition distance and diameter through lonely permutations
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Edge-colouring and total-colouring chordless graphs
Discrete Mathematics | 2014-01-20 | Paper |
Split clique graph complexity
Theoretical Computer Science | 2014-01-16 | Paper |
The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Linear time approximation for dominating sets and independent dominating sets in unit disk graphs
Approximation and Online Algorithms | 2013-09-13 | Paper |
Complexity separating classes for edge-colouring and total-colouring
Journal of the Brazilian Computer Society | 2013-08-06 | Paper |
On coloring problems of snark families
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Skew partition sandwich problem is NP-complete
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics | 2012-11-22 | Paper |
On total coloring of snark products
Matemática Contemporânea | 2012-10-06 | Paper |
On split clique graphs
Matemática Contemporânea | 2012-10-06 | Paper |
Total chromatic number of \{square,unichord\}-free graphs
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Split clique graph complexity
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
The chain graph sandwich problem
Annals of Operations Research | 2011-11-17 | Paper |
Total chromatic number of unichord-free graphs
Discrete Applied Mathematics | 2011-10-27 | Paper |
On the forbidden induced subgraph sandwich problem
Discrete Applied Mathematics | 2011-10-27 | Paper |
| Skewness, splitting number and vertex deletion of some toroidal meshes | 2011-06-29 | Paper |
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs
Networks | 2011-06-22 | Paper |
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Complexity dichotomy on partial grid recognition
Theoretical Computer Science | 2011-05-10 | Paper |
The external constraint 4 nonempty part sandwich problem
Discrete Applied Mathematics | 2011-04-19 | Paper |
Transitive orientations in bull-reducible Berge graphs
Discrete Applied Mathematics | 2011-04-19 | Paper |
Enclosing weighted points with an almost-unit ball
Information Processing Letters | 2010-09-01 | Paper |
Decompositions for edge-coloring join graphs and cobipartite graphs
Discrete Applied Mathematics | 2010-08-13 | Paper |
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Discrete Applied Mathematics | 2010-08-13 | Paper |
The polynomial dichotomy for three nonempty part sandwich problems
Discrete Applied Mathematics | 2010-08-13 | Paper |
\(2K_{2}\) vertex-set partition into nonempty parts
Discrete Mathematics | 2010-04-27 | Paper |
Chromatic index of graphs with no cycle with a unique chord
Theoretical Computer Science | 2010-03-09 | Paper |
The pair completion algorithm for the homogeneous set sandwich problem
Information Processing Letters | 2010-01-18 | Paper |
Hamiltonian paths in odd graphs
Applicable Analysis and Discrete Mathematics | 2010-01-12 | Paper |
Note on the homogeneous set sandwich problem
Information Processing Letters | 2009-08-27 | Paper |
Kinetic hanger
Information Processing Letters | 2009-07-09 | Paper |
The complexity of clique graph recognition
Theoretical Computer Science | 2009-05-28 | Paper |
A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM
International Journal of Quantum Information | 2008-11-03 | Paper |
Clique Graph Recognition Is NP-Complete
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
2K2 vertex-set partition into nonempty parts
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Sufficient conditions for a graph to be edge-colorable with maximum degree colors
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
The polynomial dichotomy for three nonempty part sandwich problems
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
On the generation of bicliques of a graph
Discrete Applied Mathematics | 2007-09-19 | Paper |
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science | 2007-09-03 | Paper |
Bull-Reducible Berge Graphs are Perfect
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Loop Graphs and Asteroidal Sets
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 5158515 (Why is no real title available?) | 2007-05-29 | Paper |
On the generation of bicliques of a graph
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Tree loop graphs
Discrete Applied Mathematics | 2007-04-18 | Paper |
| scientific article; zbMATH DE number 5130731 (Why is no real title available?) | 2007-03-05 | Paper |
Algorithms for the homogeneous set sandwich problem
Algorithmica | 2006-11-06 | Paper |
Extended skew partition problem
Discrete Mathematics | 2006-10-30 | Paper |
A characterization of \(P_{4}\)-comparability graphs
Discrete Mathematics | 2006-10-30 | Paper |
| The non planar vertex deletion of \(C_n\times C_m\). | 2006-10-16 | Paper |
The sandwich problem for cutsets: clique cutset, \(k\)-star cutset
Discrete Applied Mathematics | 2006-08-17 | Paper |
| scientific article; zbMATH DE number 2230229 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2188420 (Why is no real title available?) | 2005-07-26 | Paper |
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science | 2005-06-30 | Paper |
FindingH-partitions efficiently
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
FindingH-partitions efficiently
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
The perfection and recognition of bull-reducible Berge graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
The perfection and recognition of bull-reducible Berge graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
The perfection and recognition of bull-reducible Berge graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
Optimizing Bull-Free Perfect Graphs
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Stable skew partition problem
Discrete Applied Mathematics | 2004-11-23 | Paper |
On decision and optimization (\(k\),\(l\))-graph sandwich problems
Discrete Applied Mathematics | 2004-11-23 | Paper |
On the complexity of the approximation of nonplanarity parameters for cubic graphs
Discrete Applied Mathematics | 2004-08-06 | Paper |
The stable marriage problem with restricted pairs.
Theoretical Computer Science | 2004-03-14 | Paper |
Decompositions for the edge colouring of reduced indifference graphs.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1953085 (Why is no real title available?) | 2003-07-25 | Paper |
On the structure of bull-free perfect graphs. II: The weakly chordal case
Graphs and Combinatorics | 2003-03-27 | Paper |
Kinetic heap-ordered trees: Tight analysis and improved algorithms
Information Processing Letters | 2003-01-22 | Paper |
The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics | 2002-08-29 | Paper |
A note on transitive orientations with maximum sets of sources and sinks
Discrete Applied Mathematics | 2002-08-29 | Paper |
| Even pairs | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1512686 (Why is no real title available?) | 2002-05-14 | Paper |
| scientific article; zbMATH DE number 1463393 (Why is no real title available?) | 2002-03-14 | Paper |
On Eggleton and Guy's conjectured upper bound for the crossing number of the \(n\)-cube
Mathematica Slovaca | 2002-03-07 | Paper |
| On the complexity of the approximation of nonplanarity parameters for cubic graphs | 2001-10-24 | Paper |
| Stable marriages with restricted pairs | 2001-10-24 | Paper |
SPLITTING NUMBER is NP-complete
Discrete Applied Mathematics | 2001-10-07 | Paper |
| Linear-time algorithms for maximum sets of sources and sinks | 2001-09-23 | Paper |
Recognition of quasi-Meyniel graphs
Discrete Applied Mathematics | 2001-01-01 | Paper |
A class of \(\beta\)-perfect graphs
Discrete Mathematics | 2000-12-28 | Paper |
| scientific article; zbMATH DE number 1545651 (Why is no real title available?) | 2000-12-19 | Paper |
| scientific article; zbMATH DE number 1512684 (Why is no real title available?) | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1262805 (Why is no real title available?) | 1999-08-23 | Paper |
| scientific article; zbMATH DE number 1305502 (Why is no real title available?) | 1999-06-17 | Paper |
Even and odd pairs in comparability and in \(P_4\)-comparability graphs
Discrete Applied Mathematics | 1999-05-31 | Paper |
| scientific article; zbMATH DE number 1161313 (Why is no real title available?) | 1998-10-05 | Paper |
On edge-colouring indifference graphs
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1156685 (Why is no real title available?) | 1998-05-26 | Paper |
Path parity and perfection
Discrete Mathematics | 1998-01-12 | Paper |
Sources and sinks in comparability graphs
Order | 1997-09-29 | Paper |
On the structure of bull-free perfect graphs
Graphs and Combinatorics | 1997-05-11 | Paper |
A linear-time algorithm for proper interval graph recognition
Information Processing Letters | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 637327 (Why is no real title available?) | 1994-10-10 | Paper |
On the pebbling numbers of Flower, Blanu\v{s}a, and Watkins snarks
(available as arXiv preprint) | N/A | Paper |
An infinite family of Type 1 fullerene nanodiscs
(available as arXiv preprint) | N/A | Paper |
The sandwich problem for odd-hole-free and even-hole-free graphs
(available as arXiv preprint) | N/A | Paper |
