| Publication | Date of Publication | Type |
|---|
| Weighted domination on cocomparability graphs | 2023-03-21 | Paper |
| Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs | 2023-01-25 | Paper |
Deferred-query—An efficient approach for problems on interval and circular-arc graphs
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
Discrete Applied Mathematics | 2018-12-03 | Paper |
Fixed-parameter algorithms for Vertex Cover \(P_3\)
Discrete Optimization | 2018-05-24 | Paper |
An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
Journal of Combinatorial Optimization | 2016-08-31 | Paper |
Moderately exponential time algorithms for the maximum induced matching problem
Optimization Letters | 2015-07-22 | Paper |
Linear-time algorithms for tree root problems
Algorithmica | 2015-05-26 | Paper |
Finding large k-clubs in undirected graphs
Computing | 2015-01-26 | Paper |
Exact algorithms for problems related to the densest \(k\)-set problem
Information Processing Letters | 2014-05-05 | Paper |
Testing consistency of quartet topologies: a parameterized approach
Information Processing Letters | 2014-04-14 | Paper |
Recognition of probe distance-hereditary graphs
Discrete Applied Mathematics | 2013-01-18 | Paper |
| Independent sets in edge-clique graphs | 2012-06-10 | Paper |
| Edge-clique graphs of cocktail parties have unbounded rankwidth | 2012-05-11 | Paper |
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
Information Processing Letters | 2012-03-27 | Paper |
A property tester for tree-likeness of quartet topologies
Theory of Computing Systems | 2011-11-30 | Paper |
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
Theoretical Computer Science | 2011-10-10 | Paper |
Recognition of Probe Ptolemaic Graphs
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Block-graph width
Theoretical Computer Science | 2011-05-18 | Paper |
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
Applied Mathematics Letters | 2011-03-10 | Paper |
New fixed-parameter algorithms for the minimum quartet inconsistency problem
Theory of Computing Systems | 2010-10-06 | Paper |
Signed and minus clique-transversal functions on graphs
Information Processing Letters | 2010-06-16 | Paper |
On probe permutation graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters | 2009-12-04 | Paper |
New upper bounds on feedback vertex numbers in butterflies
Information Processing Letters | 2009-07-21 | Paper |
Block-Graph Width
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Variations of \(Y\)-dominating functions on graphs
Discrete Mathematics | 2008-09-04 | Paper |
Partitioned Probe Comparability Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Probe Ptolemaic Graphs
Lecture Notes in Computer Science | 2008-07-10 | Paper |
The 3-Steiner Root Problem
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
Parameterized and Exact Computation | 2008-06-05 | Paper |
Partitioned probe comparability graphs
Theoretical Computer Science | 2008-05-28 | Paper |
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics | 2007-10-29 | Paper |
Linear-Time Algorithms for Tree Root Problems
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics | 2006-04-28 | Paper |
Weighted irredundance of interval graphs.
Information Processing Letters | 2006-01-17 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics | 2006-01-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theoretical Computer Science | 2005-09-22 | Paper |
Hamilton cycles in split graphs with large minimum degree
Discussiones Mathematicae Graph Theory | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2044919 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 2044920 (Why is no real title available?) | 2004-02-18 | Paper |
Domination in distance-hereditary graphs
Discrete Applied Mathematics | 2002-08-24 | Paper |
The \(K_r\)-packing problem
Computing | 2002-01-24 | Paper |
| scientific article; zbMATH DE number 1555977 (Why is no real title available?) | 2001-01-24 | Paper |
| Deferred-query: An efficient approach for some problems on interval graphs | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1262785 (Why is no real title available?) | 1999-08-17 | Paper |
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
SIAM Journal on Computing | 1998-09-21 | Paper |
On minimum intersection of two minimum dominating sets of interval graphs
Discrete Applied Mathematics | 1998-03-26 | Paper |
Weighted domination of cocomparability graphs
Discrete Applied Mathematics | 1998-03-25 | Paper |
Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
Acta Informatica | 1997-06-19 | Paper |
Edge domination on bipartite permutation graphs and cotriangulated graphs
Information Processing Letters | 1997-02-28 | Paper |
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Discrete Applied Mathematics | 1997-01-13 | Paper |
Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
Information Processing Letters | 1994-02-24 | Paper |
| scientific article; zbMATH DE number 403946 (Why is no real title available?) | 1993-09-06 | Paper |
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
Discrete Applied Mathematics | 1993-01-16 | Paper |
Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
Information Processing Letters | 1992-11-29 | Paper |
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
Information Processing Letters | 1992-11-29 | Paper |
Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
Algorithmica | 1992-09-27 | Paper |
20‐relative neighborhood graphs are hamiltonian
Journal of Graph Theory | 1992-06-27 | Paper |
An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
Information Processing Letters | 1990-01-01 | Paper |
