| Publication | Date of Publication | Type |
|---|
| Computing the hull and interval numbers in the weakly toll convexity | 2024-04-04 | Paper |
| A general framework for path convexities | 2024-02-23 | Paper |
| New algorithms for the minimum coloring cut problem | 2023-11-16 | Paper |
| The iteration time and the general position number in graph convexities | 2023-04-30 | Paper |
| Geodetic convexity and Kneser graphs | 2023-04-21 | Paper |
| All-path convexity: Combinatorial and complexity aspects | 2023-03-31 | Paper |
| Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. | 2023-02-03 | Paper |
| Convex geometries over induced paths with bounded length | 2022-11-02 | Paper |
| \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers | 2022-09-15 | Paper |
| A general framework for path convexities | 2022-07-18 | Paper |
| \(P_3\)-hull number of graphs with diameter two | 2022-04-27 | Paper |
| On clique‐inverse graphs of graphs with bounded clique number | 2022-03-31 | Paper |
| Characterizations of graph classes via convex geometries: A survey | 2022-03-29 | Paper |
| Geodetic convexity and Kneser graphs | 2022-03-07 | Paper |
| On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem | 2022-03-01 | Paper |
| Edge clique partition in \((k,\ell)\)-graphs | 2021-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3382182 | 2021-09-20 | Paper |
| Declawing a graph: polyhedra and branch-and-cut algorithms | 2021-08-11 | Paper |
| The biclique partitioning polytope | 2021-06-14 | Paper |
| Vector domination in split-indifference graphs | 2019-12-19 | Paper |
| On the complete set packing and set partitioning polytopes: properties and rank 1 facets | 2019-06-11 | Paper |
| Deadlock resolution in wait-for graphs by vertex/arc deletion | 2019-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560268 | 2018-12-10 | Paper |
| Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem | 2018-10-04 | Paper |
| And/or-convexity: a graph convexity based on processes and deadlock models | 2018-06-12 | Paper |
| A computational study of \(f\)-reversible processes on graphs | 2018-05-24 | Paper |
| Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number | 2018-05-24 | Paper |
| Robust recoverable perfect matchings | 2018-05-23 | Paper |
| A matheuristic for the cell formation problem | 2018-04-19 | Paper |
| On the hardness of finding the geodetic number of a subcubic graph | 2018-04-05 | Paper |
| Cograph generation with linear delay | 2018-02-06 | Paper |
| New heuristics for the bicluster editing problem | 2017-12-15 | Paper |
| Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs | 2017-11-16 | Paper |
| Deletion graph problems based on deadlock resolution | 2017-10-23 | Paper |
| Tractability, hardness, and kernelization lower bound for and/or graph solution | 2017-10-17 | Paper |
| The Flood-It game parameterized by the vertex cover number | 2016-10-17 | Paper |
| On solving manufacturing cell formation via bicluster editing | 2016-10-07 | Paper |
| Clique cycle-transversals in distance-hereditary graphs | 2016-06-22 | Paper |
| A parallel hybrid metaheuristic for bicluster editing | 2016-06-09 | Paper |
| Efficient algorithms for cluster editing | 2016-02-23 | Paper |
| Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs | 2015-12-08 | Paper |
| On the geodetic iteration number of distance-hereditary graphs | 2015-12-08 | Paper |
| Cycles in complementary prisms | 2015-07-24 | Paper |
| On P 3-Convexity of Graphs with Bounded Degree | 2015-05-20 | Paper |
| Tractability and hardness of flood-filling games on trees | 2015-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982922 | 2015-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982361 | 2015-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982363 | 2015-04-09 | Paper |
| Algorithmic aspects of Steiner convexity and enumeration of Steiner trees | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173160 | 2015-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2936663 | 2015-01-06 | Paper |
| The predecessor-existence problem for \(k\)-reversible processes | 2014-12-02 | Paper |
| On (k,ℓ)-Graph Sandwich Problems | 2014-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403054 | 2014-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747404 | 2014-02-14 | Paper |
| Revisiting the complexity of and/or graph solution | 2014-01-27 | Paper |
| Corrigendum to ``Cycle transversals in perfect graphs and cographs | 2013-12-11 | Paper |
| New branch-and-bound algorithms for k-cardinality tree problems | 2013-07-23 | Paper |
| Hybrid Metaheuristic for Bicluster Editing Problem | 2013-07-23 | Paper |
| Cycle transversals in bounded degree graphs | 2013-07-19 | Paper |
| On s-t paths and trails in edge-colored graphs | 2013-07-19 | Paper |
| Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals | 2013-07-19 | Paper |
| Parameterized Complexity of Flood-Filling Games on Trees | 2013-06-11 | Paper |
| Cycle transversals in perfect graphs and cographs | 2013-02-19 | Paper |
| On the convexity number of graphs | 2012-12-27 | Paper |
| Mixed unit interval graphs | 2012-10-26 | Paper |
| Partitioning extended \(P_4\)-laden graphs into cliques and stable sets | 2012-10-23 | Paper |
| Exact and approximation algorithms for error-detecting even codes | 2012-08-08 | Paper |
| A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation | 2011-10-28 | Paper |
| An improved derandomized approximation algorithm for the max-controlled set problem | 2011-08-10 | Paper |
| Particionamento de Grafos Cordais em Conjuntos Independentes e Cliques | 2011-04-04 | Paper |
| Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques | 2011-03-09 | Paper |
| On the Hull Number of Triangle-Free Graphs | 2010-12-03 | Paper |
| SUTIL - network selection based on utility function and integer linear programming | 2010-11-25 | Paper |
| Complexity aspects of the Helly property: graphs and hypergraphs | 2010-10-13 | Paper |
| Complexity results related to monophonic convexity | 2010-08-13 | Paper |
| Extending the geometric build-up algorithm for the molecular distance geometry problem | 2010-06-09 | Paper |
| Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs | 2010-06-09 | Paper |
| Some remarks on the geodetic number of a graph | 2010-04-27 | Paper |
| Complexity aspects of generalized Helly hypergraphs | 2010-01-29 | Paper |
| On the computation of the hull number of a graph | 2009-12-15 | Paper |
| The Helly property on subfamilies of limited size | 2009-08-27 | Paper |
| Applying modular decomposition to parameterized cluster editing problems | 2009-08-06 | Paper |
| Structured construction and simulation of nondeterministic stochastic activity networks | 2009-06-30 | Paper |
| Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code | 2009-06-03 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615800 | 2009-03-24 | Paper |
| Partition into cliques for cubic graphs: Planar case, complexity and approximation | 2008-09-29 | Paper |
| Algorithmic Aspects of Monophonic Convexity | 2008-06-05 | Paper |
| Applying Modular Decomposition to Parameterized Bicluster Editing | 2008-06-03 | Paper |
| On the strong \(p\)-Helly property | 2008-04-16 | Paper |
| Characterization and recognition of generalized clique-Helly graphs | 2007-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439664 | 2007-05-29 | Paper |
| An efficient heuristic for selecting active nodes in wireless sensor networks | 2006-11-15 | Paper |
| List matrix partitions of chordal graphs | 2006-03-20 | Paper |
| Packing \(r\)-cliques in weighted chordal graphs | 2006-03-07 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708485 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708492 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708502 | 2005-11-18 | Paper |
| Parity codes | 2005-06-07 | Paper |
| Optimal grid representations | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4810369 | 2004-09-06 | Paper |
| Partitioning chordal graphs into independent sets and cliques | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532752 | 2002-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2717919 | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741477 | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741499 | 2001-10-24 | Paper |
| Clique-inverse graphs ofK3-free andK4-free graphs | 2001-08-16 | Paper |
