The following pages link to Annegret K. Wagler (Q324733):
Displayed 50 items.
- Item:Q324733 (redirect page) (← links)
- A polyhedral approach to locating-dominating sets in graphs (Q324734) (← links)
- On the online min-wait relocation problem (Q324815) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- An algorithmic framework for network reconstruction (Q548474) (← links)
- Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks (Q553903) (← links)
- The combinatorics of modeling and analyzing biological systems (Q553904) (← links)
- Encoding the dynamics of deterministic systems (Q634779) (← links)
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- On facets of stable set polytopes of claw-free graphs with stability number 3 (Q960958) (← links)
- Constructions for normal graphs and some consequences (Q1003480) (← links)
- Cycle-based facets of chromatic scheduling polytopes (Q1013295) (← links)
- Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques (Q1013296) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- Critical edges in perfect line graphs and some polyhedral consequences (Q1302180) (← links)
- Rank-perfect and weakly rank-perfect graphs (Q1396923) (← links)
- Lovász-Schrijver PSD-operator on some graph classes defined by clique cutsets (Q1661915) (← links)
- The normal graph conjecture for two classes of sparse graphs (Q1706428) (← links)
- Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
- Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
- Polynomial time computability of some graph parameters for superclasses of perfect graphs (Q1758876) (← links)
- Antiwebs are rank-perfect (Q1885339) (← links)
- Reconstruction of extended Petri nets from time-series data by using logical control functions (Q1937894) (← links)
- On superperfection of edge intersection graphs of paths (Q2056890) (← links)
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets (Q2064297) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs (Q2225044) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- A linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (Q2480207) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- A mathematical approach to solve the network reconstruction problem (Q2482687) (← links)
- On non-rank facets of stable set polytopes of webs with clique number four (Q2492218) (← links)
- On the combinatorial structure of chromatic scheduling polytopes (Q2500535) (← links)
- On rank-perfect subclasses of near-bipartite graphs (Q2507503) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- A lower bound on the Chvátal-rank of Antiwebs (Q2840740) (← links)
- (Q2857431) (← links)
- (Q2861542) (← links)
- The Normal Graph Conjecture for Classes of Sparse Graphs (Q2864291) (← links)
- Model reconstruction for discrete deterministic systems (Q2883564) (← links)
- On the Chvátal-rank of Antiwebs (Q2883565) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)