| Publication | Date of Publication | Type |
|---|
On non-superperfection of edge intersection graphs of paths
Discrete Optimization | 2025-01-23 | Paper |
On three domination-based identification problems in block graphs
Fundamenta Informaticae | 2024-10-07 | Paper |
Progress towards the two-thirds conjecture on locating-total dominating sets
Discrete Mathematics | 2024-09-27 | Paper |
A project and lift approach for a 2-commodity flow relocation model in a time expanded network
Discrete Applied Mathematics | 2024-08-09 | Paper |
Solving the routing and spectrum assignment problem, driven by combinatorial properties
Networks | 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
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
Branch-and-cut for a 2-commodity flow relocation model with time constraints
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
Discrete Applied Mathematics | 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
Discrete Applied Mathematics | 2022-10-13 | Paper |
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
Discrete Applied Mathematics | 2022-01-05 | Paper |
On superperfection of edge intersection graphs of paths
| 2021-12-08 | Paper |
On circular-perfect graphs: a survey
European Journal of Combinatorics | 2021-02-08 | Paper |
Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs
| 2021-02-04 | Paper |
On some graph classes related to perfect graphs: a survey
Discrete Applied Mathematics | 2020-05-29 | Paper |
Linear-time algorithms for three domination-based separation problems in block graphs
Discrete Applied Mathematics | 2020-05-29 | Paper |
Fleet management for autonomous vehicles: online PDP under special constraints
RAIRO - Operations Research | 2019-11-06 | Paper |
Fleet management for autonomous vehicles using flows in time-expanded networks
Top | 2019-07-11 | Paper |
Lovász-Schrijver PSD-operator on some graph classes defined by clique cutsets
| 2018-08-17 | Paper |
Polyhedra associated with identifying codes in graphs
Discrete Applied Mathematics | 2018-05-24 | Paper |
Progress on the description of identifying code polyhedra for some families of split graphs
Discrete Optimization | 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
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
The normal graph conjecture for two classes of sparse graphs
Graphs and Combinatorics | 2018-03-22 | Paper |
Characterizing \(N_+\)-perfect line graphs
International Transactions in Operational Research | 2017-03-16 | Paper |
Lovász-Schrijver PSD-operator on claw-free graphs
Lecture Notes in Computer Science | 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
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation
| 2015-08-28 | Paper |
Beyond perfection: computational results for superclasses
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
Preprocessing for network reconstruction: feasibility test and handling infeasibility
Fundamenta Informaticae | 2015-06-26 | Paper |
Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
Large-Scale Networks in Engineering and Life Sciences | 2015-06-19 | Paper |
Clique-perfectness of complements of line graphs
Discrete Applied Mathematics | 2015-05-22 | Paper |
Clique-perfectness and balancedness of some graph classes
International Journal of Computer Mathematics | 2014-11-28 | Paper |
Computing the clique number of \(a\)-perfect graphs in polynomial time
European Journal of Combinatorics | 2014-07-29 | Paper |
Balancedness of subclasses of circular-arc graphs
| 2014-07-01 | Paper |
On minimality and equivalence of Petri nets
Fundamenta Informaticae | 2014-04-25 | Paper |
On minimal forbidden subgraph characterizations of balanced graphs
Discrete Applied Mathematics | 2014-04-22 | Paper |
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view
RAIRO - Operations Research | 2014-02-24 | Paper |
The normal graph conjecture for classes of sparse graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Computing clique and chromatic number of circular-perfect graphs in polynomial time
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Balancedness of some subclasses of circular-arc graphs
| 2013-11-08 | Paper |
Computing the clique number of \(a\)-perfect graphs in polynomial time
| 2013-11-01 | Paper |
A lower bound on the Chvátal-rank of antiwebs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Clique-perfectness of complements of line graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
On minimal forbidden subgraph characterizations of balanced graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Reconstruction of extended Petri nets from time-series data by using logical control functions
Journal of Mathematical Biology | 2013-02-01 | Paper |
Polynomial time computability of some graph parameters for superclasses of perfect graphs
International Journal of Mathematics in Operational Research | 2012-11-16 | Paper |
Triangulation and clique separator decomposition of claw-free graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Clique and chromatic number of circular-perfect graphs
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Model reconstruction for discrete deterministic systems
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
On the Chvàtal-rank of antiwebs
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Automatic network reconstruction using ASP
Theory and Practice of Logic Programming | 2011-08-16 | Paper |
Encoding the dynamics of deterministic systems
Mathematical Methods of Operations Research | 2011-08-16 | Paper |
The combinatorics of modeling and analyzing biological systems
Natural Computing | 2011-07-28 | Paper |
Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks
Natural Computing | 2011-07-28 | Paper |
An algorithmic framework for network reconstruction
Theoretical Computer Science | 2011-06-28 | Paper |
A note on the Chvàtal-Rank of clique family inequalities
RAIRO - Operations Research | 2011-06-01 | Paper |
On the Chvàtal rank of linear relaxations of the stable set polytope
International Transactions in Operational Research | 2011-05-20 | Paper |
Comparing imperfection ratio and imperfection index for graph classes
RAIRO - Operations Research | 2010-10-26 | Paper |
On facets of stable set polytopes of claw-free graphs with stability number 3
Discrete Mathematics | 2010-03-29 | Paper |
Triangle-free strongly circular-perfect graphs
Discrete Mathematics | 2009-06-19 | Paper |
Characterizing and bounding the imperfection ratio for some classes of graphs
Mathematical Programming. Series A. Series B | 2009-05-04 | Paper |
Cycle-based facets of chromatic scheduling polytopes
Discrete Optimization | 2009-04-17 | Paper |
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
Discrete Optimization | 2009-04-17 | Paper |
Constructions for normal graphs and some consequences
Discrete Applied Mathematics | 2009-03-04 | Paper |
Circular-imperfection of triangle-free graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
A mathematical approach to solve the network reconstruction problem
Mathematical Methods of Operations Research | 2008-04-23 | Paper |
On classes of minimal circular-imperfect graphs
Discrete Applied Mathematics | 2008-04-16 | Paper |
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
Annals of Operations Research | 2008-03-31 | Paper |
On facets of stable set polytopes of claw-free graphs with stability number three
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Generalized clique family inequalities for claw-free graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Three classes of minimal circular-imperfect graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On determining the imperfection ratio
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The combinatorial stages of chromatic scheduling polytopes
| 2007-05-29 | Paper |
On strongly circular-perfectness
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The normal graph conjecture is true for circulants
| 2007-03-05 | Paper |
A construction for non-rank facets of stable set polytopes of webs
European Journal of Combinatorics | 2006-11-15 | Paper |
On rank-perfect subclasses of near-bipartite graphs
4OR | 2006-10-11 | Paper |
On the combinatorial structure of chromatic scheduling polytopes
Discrete Applied Mathematics | 2006-08-17 | Paper |
On non-rank facets of stable set polytopes of webs with clique number four
Discrete Applied Mathematics | 2006-06-09 | Paper |
Almost all webs are not rank-perfect
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
scientific article; zbMATH DE number 2230222 (Why is no real title available?)
| 2005-11-18 | Paper |
scientific article; zbMATH DE number 2230253 (Why is no real title available?)
| 2005-11-18 | Paper |
scientific article; zbMATH DE number 2196279 (Why is no real title available?)
| 2005-08-22 | Paper |
Perfectness is an Elusive Graph Property
SIAM Journal on Computing | 2005-02-21 | Paper |
Antiwebs are rank-perfect
4OR | 2004-10-28 | Paper |
scientific article; zbMATH DE number 2044950 (Why is no real title available?)
| 2004-02-18 | Paper |
Rank-perfect and weakly rank-perfect graphs
Mathematical Methods of Operations Research | 2003-07-14 | Paper |
Minimally non-preperfect graphs of small maximum degree
Graphs and Combinatorics | 2002-05-20 | Paper |
On critically perfect graphs
| 2000-04-09 | Paper |
Critical edges in perfect line graphs and some polyhedral consequences
Discrete Applied Mathematics | 2000-03-13 | Paper |
Wing-triangulated graphs are perfect
| 1997-06-09 | Paper |
Open-separating dominating codes in graphs
| N/A | Paper |
