| Publication | Date of Publication | Type |
|---|
On the hardness of problems around s-clubs on split graphs
Discrete Applied Mathematics | 2025-02-11 | Paper |
On the maximum number of edges in chordal graphs of bounded degree and matching number
Algorithmica | 2022-12-08 | Paper |
On the maximum number of edges in chordal graphs of bounded degree and matching number
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
Generation of random chordal graphs using subtrees of a tree
RAIRO - Operations Research | 2022-05-09 | Paper |
| Rainbow vertex coloring bipartite graphs and chordal graphs | 2021-08-04 | Paper |
| Parameterized aspects of strong subgraph closure | 2020-08-25 | Paper |
Finding connected secluded subgraphs
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Finding connected secluded subgraphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Parameterized aspects of strong subgraph closure
Algorithmica | 2020-05-21 | Paper |
Parameterized aspects of strong subgraph closure
Algorithmica | 2020-05-21 | Paper |
Enumeration of minimal connected dominating sets for chordal graphs
Discrete Applied Mathematics | 2020-04-21 | Paper |
Partitioning a graph into degenerate subgraphs
European Journal of Combinatorics | 2019-11-28 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | Paper |
Scheduling unit-length jobs with precedence constraints of small height
Operations Research Letters | 2018-08-27 | Paper |
Vector connectivity in graphs
Networks | 2018-05-23 | Paper |
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
Algorithmica | 2018-04-06 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Enumeration and maximum number of minimal connected vertex covers in graphs
European Journal of Combinatorics | 2017-11-14 | Paper |
| Enumerating minimal connected dominating sets in graphs of bounded chordality | 2017-09-29 | Paper |
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
European Journal of Combinatorics | 2017-09-11 | Paper |
Linear-time generation of random chordal graphs
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
Discrete Mathematics | 2017-02-27 | Paper |
Minimal dominating sets in interval graphs and trees
Discrete Applied Mathematics | 2016-11-24 | Paper |
On recognition of threshold tolerance graphs and their complements
Discrete Applied Mathematics | 2016-11-24 | Paper |
Maximal induced matchings in triangle-free graphs
Journal of Graph Theory | 2016-11-16 | Paper |
| Recognizability equals definability for graphs of bounded treewidth and bounded chordality | 2016-10-14 | Paper |
Enumerating minimal dominating sets in chordal graphs
Information Processing Letters | 2016-08-16 | Paper |
Enumerating minimal connected dominating sets in graphs of bounded chordality
Theoretical Computer Science | 2016-05-02 | Paper |
Clique-width of path powers
Discrete Applied Mathematics | 2016-04-07 | Paper |
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
Lecture Notes in Computer Science | 2016-01-11 | Paper |
The firefighter problem on graph classes
Theoretical Computer Science | 2015-12-28 | Paper |
Enumerating minimal dominating sets in chordal bipartite graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
Maximal induced matchings in triangle-free graphs
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Recognizing threshold tolerance graphs in O(n^2) time
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Hadwiger number of graphs with small chordality
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Finding disjoint paths in split graphs
Theory of Computing Systems | 2015-09-04 | Paper |
On the parameterized complexity of finding separators with non-hereditary properties
Algorithmica | 2015-09-02 | Paper |
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Algorithmica | 2015-09-02 | Paper |
Hadwiger number of graphs with small chordality
SIAM Journal on Discrete Mathematics | 2015-08-17 | Paper |
A characterisation of clique-width through nested partitions
Discrete Applied Mathematics | 2015-06-10 | Paper |
Computing the metric dimension for chain graphs
Information Processing Letters | 2015-06-02 | Paper |
Modifying a graph using vertex elimination
Algorithmica | 2015-05-21 | Paper |
A multi-parameter analysis of hard problems on deterministic finite automata
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Finding disjoint paths in split graphs
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Induced subgraph isomorphism on proper interval and bipartite permutation graphs
Theoretical Computer Science | 2014-12-02 | Paper |
Enumerating minimal subset feedback vertex sets
Algorithmica | 2014-11-19 | Paper |
| Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) | 2014-10-13 | Paper |
Graph classes and Ramsey numbers
Discrete Applied Mathematics | 2014-08-22 | Paper |
Finding clubs in graph classes
Discrete Applied Mathematics | 2014-08-22 | Paper |
Detecting fixed patterns in chordal graphs in polynomial time
Algorithmica | 2014-07-03 | Paper |
Contracting chordal graphs and bipartite graphs to paths and trees
Discrete Applied Mathematics | 2014-05-05 | Paper |
Subset feedback vertex sets in chordal graphs
Journal of Discrete Algorithms | 2014-04-28 | Paper |
Obtaining a bipartite graph by contracting few edges
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Guest editors' foreword
Discrete Applied Mathematics | 2014-04-02 | Paper |
Contracting graphs to paths and trees
Algorithmica | 2014-03-25 | Paper |
Induced subtrees in interval graphs
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
Information and Computation | 2014-01-16 | Paper |
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical Computer Science | 2014-01-13 | Paper |
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Theoretical Computer Science | 2013-12-11 | Paper |
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Automata, Languages, and Programming | 2013-08-06 | Paper |
Contracting chordal graphs and bipartite graphs to paths and trees
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A new representation of proper interval graphs with an application to clique-width
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Cliques and clubs
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Vector connectivity in graphs
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Choosability on \(H\)-free graphs
Information Processing Letters | 2013-03-20 | Paper |
A multivariate analysis of some DFA problems
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Polar permutation graphs are polynomial-time recognisable
European Journal of Combinatorics | 2013-01-24 | Paper |
An exact algorithm for subset feedback vertex set on chordal graphs
Parameterized and Exact Computation | 2013-01-07 | Paper |
Computing the cutwidth of bipartite permutation graphs in linear time
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
On the parameterized complexity of finding separators with non-hereditary properties
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
How to eliminate a graph
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Ramsey numbers for line graphs and perfect graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Computing role assignments of proper interval graphs in polynomial time
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Broadcast domination on block graphs in linear time
Computer Science – Theory and Applications | 2012-09-10 | Paper |
| Obtaining a bipartite graph by contracting few edges | 2012-08-31 | Paper |
Computing minimum geodetic sets of proper interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Contracting graphs to paths and trees
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Edge contractions in subclasses of chordal graphs
Discrete Applied Mathematics | 2012-05-30 | Paper |
Edge search number of cographs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Cutwidth of split graphs and threshold graphs
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Finding contractions and induced minors in chordal graphs via disjoint paths
Algorithms and Computation | 2011-12-16 | Paper |
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
Faster parameterized algorithms for \textsc{Minimum Fill-in}
Algorithmica | 2011-12-14 | Paper |
Bandwidth on AT-free graphs
Theoretical Computer Science | 2011-12-07 | Paper |
Graphs of linear clique-width at most 3
Theoretical Computer Science | 2011-10-10 | Paper |
Parameterized complexity of vertex deletion into perfect graph classes
Fundamentals of Computation Theory | 2011-08-19 | Paper |
A generic approach to decomposition algorithms, with an application to digraph decomposition
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Enumerating minimal subset feedback vertex sets
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Edge contractions in subclasses of chordal graphs
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
Computer Science – Theory and Applications | 2011-06-17 | Paper |
Computing role assignments of proper interval graphs in polynomial time
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
Theoretical Computer Science | 2011-03-14 | Paper |
Induced subgraph isomorphism on interval and proper interval graphs
Algorithms and Computation | 2010-12-09 | Paper |
Mixed search number and linear-width of interval and split graphs
Networks | 2010-11-24 | Paper |
Generalized graph clustering: recognizing (p,q)-cluster graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Computing the cutwidth of bipartite permutation graphs in linear time
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Hardness and approximation of minimum distortion embeddings
Information Processing Letters | 2010-09-07 | Paper |
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Lecture Notes in Computer Science | 2010-06-17 | Paper |
A parameterized algorithm for chordal sandwich
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Minimal split completions
Discrete Applied Mathematics | 2010-04-28 | Paper |
Graph searching, elimination trees, and a generalization of bandwidth.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Clustering with partial information
Theoretical Computer Science | 2010-03-09 | Paper |
The minimum degree heuristic and the minimal triangulation process.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Bandwidth on AT-free graphs
Algorithms and Computation | 2009-12-17 | Paper |
Polar permutation graphs
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Bandwidth of bipartite permutation graphs in polynomial time
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Interval Completion Is Fixed Parameter Tractable
SIAM Journal on Computing | 2009-11-06 | Paper |
Fast Computation of Minimal Fill Inside A Given Elimination Ordering
SIAM Journal on Matrix Analysis and Applications | 2009-11-06 | Paper |
Choosability of P 5-Free Graphs
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Edge Search Number of Cographs in Linear Time
Frontiers in Algorithmics | 2009-07-14 | Paper |
Dynamically maintaining split graphs
Discrete Applied Mathematics | 2009-06-24 | Paper |
A Complete Characterisation of the Linear Clique-Width of Path Powers
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
Theoretical Computer Science | 2009-02-19 | Paper |
Clustering with Partial Information
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Faster Parameterized Algorithms for Minimum Fill-In
Algorithms and Computation | 2009-01-29 | Paper |
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
| Linear-time certifying recognition algorithms and forbidden induced subgraphs | 2009-01-15 | Paper |
Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
Theoretical Computer Science | 2009-01-08 | Paper |
| scientific article; zbMATH DE number 5485472 (Why is no real title available?) | 2009-01-05 | Paper |
Minimal Split Completions of Graphs
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Mixed Search Number and Linear-Width of Interval and Split Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Mixed Search Number of Permutation Graphs
Frontiers in Algorithmics | 2008-06-19 | Paper |
Graphs of Linear Clique-Width at Most 3
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
Algorithms and Computation | 2008-04-24 | Paper |
Bandwidth of Bipartite Permutation Graphs in Polynomial Time
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Minimal comparability completions of arbitrary graphs
Discrete Applied Mathematics | 2008-03-18 | Paper |
Exact algorithms for graph homomorphisms
Theory of Computing Systems | 2007-09-06 | Paper |
Optimal Linear Arrangement of Interval Graphs
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Characterizing Minimal Interval Completions
STACS 2007 | 2007-09-03 | Paper |
A completely dynamic algorithm for split graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Optimal broadcast domination in polynomial time
Discrete Mathematics | 2006-12-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms | 2006-04-28 | Paper |
Minimal triangulations of graphs: a survey
Discrete Mathematics | 2006-03-29 | Paper |
A vertex incremental approach for maintaining chordality
Discrete Mathematics | 2006-03-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
| scientific article; zbMATH DE number 2170461 (Why is no real title available?) | 2005-05-23 | Paper |
Graph searching, elimination trees, and a generalization of bandwidth
Algorithmica | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2111730 (Why is no real title available?) | 2004-10-28 | Paper |
Maximum cardinality search for computing minimal triangulations of graphs
Algorithmica | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 1953077 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1953094 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1947421 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1617254 (Why is no real title available?) | 2001-07-11 | Paper |
Recognizing weakly triangulated graphs by edge separability
Nordic Journal of Computing | 2001-04-17 | Paper |
Methods for large scale total least squares problems
SIAM Journal on Matrix Analysis and Applications | 2001-03-19 | Paper |
A practical algorithm for making filled graphs minimal
Theoretical Computer Science | 2000-12-12 | Paper |
| scientific article; zbMATH DE number 1202982 (Why is no real title available?) | 1999-01-11 | Paper |
Making an arbitrary filled graph minimal by removing fill edges
Algorithm Theory — SWAT'96 | 1998-02-08 | Paper |
Finding minimum height elimination trees for interval graphs in polynomial time
BIT | 1995-06-19 | Paper |
