Annegret Wagler

it Inf. Technol., 2014

Clique-perfectness and balancedness of some graph classes.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2014

Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Computing the clique number of <i>a</i>a-perfect graphs in polynomial time.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Balancedness of subclasses of circular-arc graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Relocation in Carsharing Systems Using Flows in Time-Expanded Networks.

[BibT_eX]

[DOI]

Sven O. Krumke

Alain Quilliot

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Study of Identifying Code Polyhedra for Some Families of Split Graphs.

[BibT_eX]

[DOI]

Gabriela R. Argiroffo

Silvia M. Bianchi

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Integrating a priori knowledge in automatic network reconstruction.

[BibT_eX]

[DOI]

Marie C. F. Favre

Proceedings of the 5th International Workshop on Biological Processes & Petri Nets co-located with 35th International Conference on Application and Theory of Petri Nets and Concurreny (PETRI NETS 2014), 2014

Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow.

[BibT_eX]

[DOI]

Proceedings of the Large-Scale Networks in Engineering and Life Sciences, 2014

2013

Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2013

Computing clique and chromatic number of circular-perfect graphs in polynomial time.

[BibT_eX]

[DOI]

Math. Program., 2013

On Minimality and Equivalence of Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Models and Algorithms for Carsharing Systems and Related Problems.

[BibT_eX]

[DOI]

Sven O. Krumke

Alain Quilliot

Electron. Notes Discret. Math., 2013

Polyhedra associated with identifying codes.

[BibT_eX]

[DOI]

Gabriela R. Argiroffo

Silvia M. Bianchi

Electron. Notes Discret. Math., 2013

Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms.

[BibT_eX]

[DOI]

Balamurali Sreedhar

Andreas Seidel-Morgenstern

Malte Kaspereit

Comput. Chem. Eng., 2013

The Normal Graph Conjecture for Classes of Sparse Graphs.

[BibT_eX]

[DOI]

Anne Berry

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Reconstructing X'-deterministic extended Petri nets from experimental time-series data X'.

[BibT_eX]

[DOI]

Marie C. F. Favre

Proceedings of the International Workshop on Biological Processes & Petri Nets, 2013

2012

Polynomial time computability of some graph parameters for superclasses of perfect graphs.

[BibT_eX]

[DOI]

Int. J. Math. Oper. Res., 2012

Triangulation and Clique Separator Decomposition of Claw-Free Graphs.

[BibT_eX]

[DOI]

Anne Berry

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Automatic network reconstruction using ASP.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2011

An algorithmic framework for network reconstruction.

[BibT_eX]

[DOI]

Markus Durzinsky

Theor. Comput. Sci., 2011

The combinatorics of modeling and analyzing biological systems.

[BibT_eX]

[DOI]

Nat. Comput., 2011

Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks.

[BibT_eX]

[DOI]

Nat. Comput., 2011

Encoding the dynamics of deterministic systems.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2011

Computing the clique number of a-perfect graphs in polynomial time.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

A lower bound on the Chvátal-rank of Antiwebs.

[BibT_eX]

[DOI]

Eugenia Holm

Electron. Notes Discret. Math., 2011

Clique-perfectness of complements of line graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks.

[BibT_eX]

[DOI]

Markus Durzinsky

BMC Syst. Biol., 2011

The dynamics of deterministic systems from a hypergraph theoretical point of view.

[BibT_eX]

[DOI]

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Generalized row family inequalities for the set covering polyhedron.

[BibT_eX]

[DOI]

Gabriela R. Argiroffo

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

On the Chvátal rank of linear relaxations of the stable set polytope.

[BibT_eX]

[DOI]

Eugenia Holm

Int. Trans. Oper. Res., 2010

Model reconstruction for discrete deterministic systems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Clique and chromatic number of circular-perfect graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

On the Chvátal-rank of Antiwebs.

[BibT_eX]

[DOI]

Eugenia Holm

Electron. Notes Discret. Math., 2010

Balancedness of some subclasses of circular-arc graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

On facets of stable set polytopes of claw-free graphs with stability number 3.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Characterizing and bounding the imperfection ratio for some classes of graphs.

[BibT_eX]

[DOI]

Sylvain Coulonges

Math. Program., 2009

On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On minimal forbidden subgraph characterizations of balanced graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Triangle-free strongly circular-perfect graphs.

[BibT_eX]

[DOI]

Sylvain Coulonges

Discret. Math., 2009

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.

[BibT_eX]

[DOI]

Discret. Optim., 2009

Cycle-based facets of chromatic scheduling polytopes.

[BibT_eX]

[DOI]

Discret. Optim., 2009

2008

Comparing Imperfection Ratio and Imperfection Index for Graph Classes.

[BibT_eX]

[DOI]

Arie M. C. A. Koster

RAIRO Oper. Res., 2008

A mathematical approach to solve the network reconstruction problem.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2008

Constructions for normal graphs and some consequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

On classes of minimal circular-imperfect graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Automatic reconstruction of molecular and genetic networks from discrete time series data.

[BibT_eX]

[DOI]

Biosyst., 2008

A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data.

[BibT_eX]

[DOI]

Markus Durzinsky

Proceedings of the Computational Methods in Systems Biology, 6th International Conference, 2008

2007

A note on the Chvátal-rank of clique family inequalities.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2007

On facets of stable set polytopes of claw-free graphs with stability number three.

[BibT_eX]

[DOI]

Pierre Pesneau

Electron. Notes Discret. Math., 2007

Circular-imperfection of triangle-free graphs.

[BibT_eX]

[DOI]

Jens Kuhpfahl

Christian Wagner

Electron. Notes Discret. Math., 2007

Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

2006

Almost all webs are not rank-perfect.

[BibT_eX]

[DOI]

Math. Program., 2006

Generalized clique family inequalities for claw-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

On determining the imperfection ratio.

[BibT_eX]

[DOI]

Arie M. C. A. Koster

Electron. Notes Discret. Math., 2006

A construction for non-rank facets of stable set polytopes of webs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

On non-rank facets of stable set polytopes of webs with clique number four.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

On the combinatorial structure of chromatic scheduling polytopes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Three classes of minimal circular-imperfect graphs.

[BibT_eX]

[DOI]

Xuding Zhu

Electron. Notes Discret. Math., 2005

The combinatorial stages of chromatic scheduling polytopes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On strongly circular-perfectness.

[BibT_eX]

[DOI]

Sylvain Coulonges

Electron. Notes Discret. Math., 2005

On rank-perfect subclasses of near-bipartite graphs.

[BibT_eX]

[DOI]

4OR, 2005

2004

Perfectness is an Elusive Graph Property.

[BibT_eX]

[DOI]

Stefan Hougardy

SIAM J. Comput., 2004

Combinatorial equivalence of Chromatic Scheduling Polytopes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Antiwebs are rank-perfect.

[BibT_eX]

[DOI]

4OR, 2004

Relaxing Perfectness: Which Graphs Are "Almost" Perfect?

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

2002

Rank-perfect and" weakly rank-perfect graphs.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2002

2001

Minimally Non-Preperfect Graphs of Small Maximum Degree.

[BibT_eX]

[DOI]

Zsolt Tuza

Graphs Comb., 2001

Critical and Anticritical Edges in Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

1999

On critically perfect graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Critical Edges in Perfect Line Graphs and some Polyhedral Consequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1997

Wing-triangulated graphs are perfect.

[BibT_eX]

[DOI]

Stefan Hougardy

Van Bang Le