| Publication | Date of Publication | Type |
|---|
Recognizing geometric intersection graphs stabbed by a line
Theoretical Computer Science | 2024-03-28 | Paper |
Decomposing subcubic graphs into claws, paths or triangles
Journal of Graph Theory | 2023-10-04 | Paper |
On the complexity of recognizing Stick, BipHook and max point-tolerance graphs
Theoretical Computer Science | 2023-03-24 | Paper |
Raney numbers, threshold sequences and Motzkin-like paths
Discrete Mathematics | 2022-08-24 | Paper |
Forced pairs in \(A\)-Stick graphs
Discrete Mathematics | 2022-06-14 | Paper |
Hamiltonian problems in directed graphs with simple row patterns
Theoretical Computer Science | 2022-05-31 | Paper |
Admissible pinnacle orderings
Graphs and Combinatorics | 2021-07-28 | Paper |
Sorting permutations with fixed pinnacle set
The Electronic Journal of Combinatorics | 2020-08-07 | Paper |
The contig assembly problem and its algorithmic solutions
Algorithms for Next-Generation Sequencing Data | 2020-08-07 | Paper |
Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
Theoretical Computer Science | 2019-05-17 | Paper |
Finding supported paths in heterogeneous networks
Algorithms | 2019-03-26 | Paper |
Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints
Journal of Discrete Algorithms | 2018-09-27 | Paper |
The \(S\)-\textsc{labeling} problem: an algorithmic tour
Discrete Applied Mathematics | 2018-06-27 | Paper |
Sorting signed permutations by reversals using link-cut trees
Information Processing Letters | 2018-03-16 | Paper |
Graph matching problems and the NP-hardness of sortedness constraints
Theoretical Computer Science | 2017-09-13 | Paper |
\(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
Theoretical Computer Science | 2016-12-22 | Paper |
Decomposing cubic graphs into connected subgraphs of size three
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Recognizing \(i\)-triangulated graphs in \(O(mn)\) time
Information Processing Letters | 2016-06-16 | Paper |
Permutation reconstruction from MinMax-betweenness constraints
Discrete Applied Mathematics | 2016-06-01 | Paper |
Algorithmic aspects of the \(S\)-labeling problem
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Obtaining a triangular matrix by independent row-column permutations
Algorithms and Computation | 2016-01-11 | Paper |
Pancake flipping is hard
Journal of Computer and System Sciences | 2015-08-31 | Paper |
Holes and dominoes in Meyniel graphs
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
On graphs with limited number of \(P_{4}\)-partners
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Path-driven orientation of mixed graphs
Discrete Applied Mathematics | 2014-12-05 | Paper |
Extending common intervals searching from permutations to sequences
Journal of Discrete Algorithms | 2014-11-24 | Paper |
\textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
Theoretical Computer Science | 2014-07-07 | Paper |
Maximal strip recovery problem with gaps: hardness and approximation algorithms
Journal of Discrete Algorithms | 2014-02-03 | Paper |
Revisiting the minimum breakpoint linearization problem
Theoretical Computer Science | 2014-01-10 | Paper |
Sorting by transpositions is difficult
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Pancake flipping is hard
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Tractability and approximability of maximal strip recovery
Theoretical Computer Science | 2012-08-08 | Paper |
New applications of interval generators to genome comparison
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Algorithmic aspects of heterogeneous biological networks comparison
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Sorting by transpositions is difficult
Lecture Notes in Computer Science | 2011-07-06 | Paper |
Tractability and approximability of maximal strip recovery
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Statistical properties of factor oracles
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Revisiting the minimum breakpoint linearization problem
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Maximal strip recovery problem with gaps: hardness and approximation algorithms
Algorithms and Computation | 2009-12-17 | Paper |
The strong perfect graph conjecture: 40 years of attempts, and its resolution
Discrete Mathematics | 2009-12-15 | Paper |
Combinatorics of genome rearrangements.
| 2009-08-26 | Paper |
Statistical Properties of Factor Oracles
Combinatorial Pattern Matching | 2009-07-07 | Paper |
On the Approximability of Comparing Genomes with Duplicates
Journal of Graph Algorithms and Applications | 2009-05-19 | Paper |
Extending the Hardness of RNA Secondary Structure Comparison
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Converting suffix trees into factor/suffix oracles
Journal of Discrete Algorithms | 2008-08-08 | Paper |
On the Approximability of Comparing Genomes with Duplicates
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
Maximum weight edge-constrained matchings
Discrete Applied Mathematics | 2008-03-18 | Paper |
Hard problems in similarity searching
Discrete Applied Mathematics | 2004-11-12 | Paper |
Dirac-type characterizations of graphs without long chordless cycles
Discrete Mathematics | 2002-12-02 | Paper |
Loose vertices in \(C_{4}\)-free Berge graphs
Discrete Mathematics | 2002-12-02 | Paper |
A linear algorithm to color \(i\)-triangulated graphs
Information Processing Letters | 2002-07-25 | Paper |
Forbidden subgraph decomposition
Discrete Mathematics | 2002-05-28 | Paper |
Cutsets in perfect and minimal imperfect graphs
| 2002-05-02 | Paper |
Domination graphs: Examples and counterexamples
Discrete Applied Mathematics | 2002-04-08 | Paper |
An \(O(n^2)\) algorithm to color Meyniel graphs
Discrete Mathematics | 2001-10-23 | Paper |
Even pairs in Artemis graphs
Discrete Mathematics | 2001-08-30 | Paper |
scientific article; zbMATH DE number 1420924 (Why is no real title available?)
| 2000-08-07 | Paper |
Perfectly contractile diamond-free graphs
| 2000-04-09 | Paper |
\(P_4\)-domination in minimal imperfect graphs
Discrete Applied Mathematics | 2000-04-04 | Paper |
scientific article; zbMATH DE number 1339824 (Why is no real title available?)
| 2000-01-11 | Paper |
Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
Discrete Applied Mathematics | 1999-01-05 | Paper |
Building counterexamples
Discrete Mathematics | 1997-10-22 | Paper |
On transversals in minimal imperfect graphs
Discrete Mathematics | 1997-10-20 | Paper |
Properly orderable graphs
Discrete Mathematics | 1997-04-07 | Paper |
Quasi-parity and perfect graphs
Information Processing Letters | 1997-02-27 | Paper |
Perfect and locally perfect colorings
Journal of Graph Theory | 1996-05-30 | Paper |
A new class of perfect Hoàng graphs
Discrete Mathematics | 1995-12-03 | Paper |
