| Publication | Date of Publication | Type |
|---|
| Solving the routing and spectrum assignment problem, driven by combinatorial properties | 2024-03-15 | Paper |
| Location-Domination Type Problems Under the Mycielski Construction | 2023-11-23 | Paper |
| On three domination-based identification problems in block graphs | 2023-08-17 | Paper |
| Branch-and-cut for a 2-commodity flow relocation model with time constraints | 2023-08-03 | Paper |
| Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs | 2023-04-17 | Paper |
| Progress towards the two-thirds conjecture on locating-total dominating sets | 2022-11-25 | Paper |
| Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs | 2022-10-13 | Paper |
| On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets | 2022-01-05 | Paper |
| On superperfection of edge intersection graphs of paths | 2021-12-08 | Paper |
| On circular-perfect graphs: a survey | 2021-02-08 | Paper |
| Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs | 2021-02-04 | Paper |
| Linear-time algorithms for three domination-based separation problems in block graphs | 2020-05-29 | Paper |
| On some graph classes related to perfect graphs: a survey | 2020-05-29 | Paper |
| Fleet management for autonomous vehicles: Online PDP under special constraints | 2019-11-06 | Paper |
| Fleet management for autonomous vehicles using flows in time-expanded networks | 2019-07-11 | Paper |
| Lovász-Schrijver PSD-operator on some graph classes defined by clique cutsets | 2018-08-17 | Paper |
| Progress on the description of identifying code polyhedra for some families of split graphs | 2018-05-24 | Paper |
| Polyhedra associated with identifying codes in graphs | 2018-05-24 | Paper |
| A linear-time algorithm for the identifying code problem on block graphs | 2018-04-09 | Paper |
| Fleet management for autonomous vehicles using flows in time-expanded networks | 2018-04-09 | Paper |
| The normal graph conjecture for two classes of sparse graphs | 2018-03-22 | Paper |
| Characterizing N+-perfect line graphs | 2017-03-16 | Paper |
| Lovász-Schrijver PSD-Operator on Claw-Free Graphs | 2016-11-30 | Paper |
| A polyhedral approach to locating-dominating sets in graphs | 2016-10-17 | Paper |
| On the online min-wait relocation problem | 2016-10-17 | Paper |
| Study of Identifying Code Polyhedra for Some Families of Split Graphs | 2015-10-16 | Paper |
| Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation | 2015-08-28 | Paper |
| Beyond Perfection: Computational Results for Superclasses | 2015-07-22 | Paper |
| Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility | 2015-06-26 | Paper |
| Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow | 2015-06-19 | Paper |
| Clique-perfectness of complements of line graphs | 2015-05-22 | Paper |
| Clique-perfectness and balancedness of some graph classes | 2014-11-28 | Paper |
| Computing the clique number of \(a\)-perfect graphs in polynomial time | 2014-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5167720 | 2014-07-01 | Paper |
| On Minimality and Equivalence of Petri Nets | 2014-04-25 | Paper |
| On minimal forbidden subgraph characterizations of balanced graphs | 2014-04-22 | Paper |
| Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view | 2014-02-24 | Paper |
| The Normal Graph Conjecture for Classes of Sparse Graphs | 2013-12-06 | Paper |
| Computing clique and chromatic number of circular-perfect graphs in polynomial time | 2013-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861542 | 2013-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857431 | 2013-11-01 | Paper |
| A lower bound on the Chvátal-rank of Antiwebs | 2013-07-23 | Paper |
| Clique-perfectness of complements of line graphs | 2013-07-23 | Paper |
| On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs | 2013-07-19 | Paper |
| On minimal forbidden subgraph characterizations of balanced graphs | 2013-07-19 | Paper |
| Reconstruction of extended Petri nets from time-series data by using logical control functions | 2013-02-01 | Paper |
| Polynomial time computability of some graph parameters for superclasses of perfect graphs | 2012-11-16 | Paper |
| Triangulation and Clique Separator Decomposition of Claw-Free Graphs | 2012-11-06 | Paper |
| Model reconstruction for discrete deterministic systems | 2012-05-13 | Paper |
| On the Chvátal-rank of Antiwebs | 2012-05-13 | Paper |
| Clique and chromatic number of circular-perfect graphs | 2012-05-13 | Paper |
| Encoding the dynamics of deterministic systems | 2011-08-16 | Paper |
| Automatic network reconstruction using ASP | 2011-08-16 | Paper |
| Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks | 2011-07-28 | Paper |
| The combinatorics of modeling and analyzing biological systems | 2011-07-28 | Paper |
| An algorithmic framework for network reconstruction | 2011-06-28 | Paper |
| A note on the Chvátal-rank of clique family inequalities | 2011-06-01 | Paper |
| On the Chvátal rank of linear relaxations of the stable set polytope | 2011-05-20 | Paper |
| Comparing Imperfection Ratio and Imperfection Index for Graph Classes | 2010-10-26 | Paper |
| On facets of stable set polytopes of claw-free graphs with stability number 3 | 2010-03-29 | Paper |
| Triangle-free strongly circular-perfect graphs | 2009-06-19 | Paper |
| Characterizing and bounding the imperfection ratio for some classes of graphs | 2009-05-04 | Paper |
| Cycle-based facets of chromatic scheduling polytopes | 2009-04-17 | Paper |
| Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques | 2009-04-17 | Paper |
| Constructions for normal graphs and some consequences | 2009-03-04 | Paper |
| Circular-imperfection of triangle-free graphs | 2008-06-05 | Paper |
| A mathematical approach to solve the network reconstruction problem | 2008-04-23 | Paper |
| On classes of minimal circular-imperfect graphs | 2008-04-16 | Paper |
| Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems | 2008-03-31 | Paper |
| On strongly circular-perfectness | 2007-05-29 | Paper |
| Generalized clique family inequalities for claw-free graphs | 2007-05-29 | Paper |
| On determining the imperfection ratio | 2007-05-29 | Paper |
| On facets of stable set polytopes of claw-free graphs with stability number three | 2007-05-29 | Paper |
| Three classes of minimal circular-imperfect graphs | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439663 | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424793 | 2007-03-05 | Paper |
| A construction for non-rank facets of stable set polytopes of webs | 2006-11-15 | Paper |
| On rank-perfect subclasses of near-bipartite graphs | 2006-10-11 | Paper |
| On the combinatorial structure of chromatic scheduling polytopes | 2006-08-17 | Paper |
| On non-rank facets of stable set polytopes of webs with clique number four | 2006-06-09 | Paper |
| Almost all webs are not rank-perfect | 2006-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708510 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708546 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465111 | 2005-08-22 | Paper |
| Perfectness is an Elusive Graph Property | 2005-02-21 | Paper |
| Antiwebs are rank-perfect | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448770 | 2004-02-18 | Paper |
| Rank-perfect and weakly rank-perfect graphs | 2003-07-14 | Paper |
| Minimally non-preperfect graphs of small maximum degree | 2002-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4719328 | 2000-04-09 | Paper |
| Critical edges in perfect line graphs and some polyhedral consequences | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284593 | 1997-06-09 | Paper |
