 | 2012 |
|---|
| 25 |       | Frank Gurski,
Patrick Gwydion Poullie:
Interval Routing Schemes for Circular-Arc Graphs
CoRR abs/1202.4160: (2012) |
| 2010 |
|---|
| 24 | | Frank Gurski,
Irene Rothe,
Jörg Rothe,
Egon Wanke:
Exakte Algorithmen für schwere Graphenprobleme.
Springer 2010: I-XII, 1-331 |
| 2009 |
|---|
| 23 | | Frank Gurski,
Egon Wanke:
On Module-Composed Graphs.
WG 2009: 166-177 |
| 22 | | Frank Gurski,
Egon Wanke:
The NLC-width and clique-width for powers of graphs of bounded tree-width.
Discrete Applied Mathematics 157(4): 583-595 (2009) |
| 2008 |
|---|
| 21 | | Frank Gurski:
A comparison of two approaches for polynomial time algorithms computing basic graph parameters
CoRR abs/0806.4073: (2008) |
| 20 | | Frank Gurski:
Graph parameters measuring neighbourhoods in graphs - Bounds and applications.
Discrete Applied Mathematics 156(10): 1865-1874 (2008) |
| 19 | | Frank Gurski:
Polynomial algorithms for protein similarity search for restricted mRNA structures.
Inf. Process. Lett. 105(5): 170-176 (2008) |
| 2007 |
|---|
| 18 | | Frank Gurski,
Egon Wanke:
The Clique-Width of Tree-Power and Leaf-Power Graphs.
WG 2007: 76-85 |
| 17 | | Frank Gurski:
Polynomial algorithms for protein similarity search for restricted mRNA structures
CoRR abs/0704.3496: (2007) |
| 16 | | Frank Gurski:
A note on module-composed graphs
CoRR abs/0705.1521: (2007) |
| 15 | | Frank Gurski:
Graph Operations on Clique-Width Bounded Graphs
CoRR abs/cs/0701185: (2007) |
| 14 | | Frank Gurski,
Egon Wanke:
Line graphs of bounded clique-width.
Discrete Mathematics 307(22): 2734-2754 (2007) |
| 13 | | Frank Gurski,
Egon Wanke:
A local characterization of bounded clique-width for line graphs.
Discrete Mathematics 307(6): 756-759 (2007) |
| 12 | | Frank Gurski:
Characterizations for restricted graphs of NLC-width 2.
Theor. Comput. Sci. 372(1): 108-114 (2007) |
| 2006 |
|---|
| 11 | | Frank Gurski:
Linear layouts measuring neighbourhoods in graphs.
Discrete Mathematics 306(15): 1637-1650 (2006) |
| 10 | | Frank Gurski:
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations.
Discrete Mathematics 306(2): 271-277 (2006) |
| 9 | | Frank Gurski,
Egon Wanke:
Vertex disjoint paths on clique-width bounded graphs.
Theor. Comput. Sci. 359(1-3): 188-199 (2006) |
| 2005 |
|---|
| 8 | | Frank Gurski,
Egon Wanke:
Minimizing NLC-Width is NP-Complete.
WG 2005: 69-80 |
| 7 | | Frank Gurski,
Egon Wanke:
On the relationship between NLC-width and linear NLC-width.
Theor. Comput. Sci. 347(1-2): 76-89 (2005) |
| 2004 |
|---|
| 6 | | Frank Gurski,
Egon Wanke:
Vertex Disjoint Paths on Clique-Width Bounded Graphs.
LATIN 2004: 119-128 |
| 2003 |
|---|
| 5 | | Wolfgang Espelage,
Frank Gurski,
Egon Wanke:
Deciding Clique-Width for Graphs of Bounded Tree-Width.
J. Graph Algorithms Appl. 7(2): 141-180 (2003) |
| 4 | | Frank Gurski:
Effiziente Algorithmen für baumstrukturierte Graphklassen.
Heinrich Heine University Düsseldorf 2003: 1-137 |
| 2001 |
|---|
| 3 | | Wolfgang Espelage,
Frank Gurski,
Egon Wanke:
Deciding Clique-Width for Graphs of Bounded Tree-Width.
WADS 2001: 87-98 |
| 2 | | Wolfgang Espelage,
Frank Gurski,
Egon Wanke:
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.
WG 2001: 117-128 |
| 2000 |
|---|
| 1 | | Frank Gurski,
Egon Wanke:
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n.
WG 2000: 196-205 |
Data released under the ODC-BY 1.0 license — See also our legal information page