The SCEAS System
| |||||||

## Search the dblp DataBase
Frank Gurski:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Frank Gurski, Egon Wanke
**Vertex Disjoint Paths on Clique-Width Bounded Graphs.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:119-128 [Conf] - Wolfgang Espelage, Frank Gurski, Egon Wanke
**Deciding Clique-Width for Graphs of Bounded Tree-Width.**[Citation Graph (0, 0)][DBLP] WADS, 2001, pp:87-98 [Conf] - Wolfgang Espelage, Frank Gurski, Egon Wanke
**How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.**[Citation Graph (0, 0)][DBLP] WG, 2001, pp:117-128 [Conf] - Frank Gurski, Egon Wanke
**The Tree-Width of Clique-Width Bounded Graphs Without**[Citation Graph (0, 0)][DBLP]*K*._{n, n} WG, 2000, pp:196-205 [Conf] - Frank Gurski, Egon Wanke
**Minimizing NLC-Width is NP-Complete.**[Citation Graph (0, 0)][DBLP] WG, 2005, pp:69-80 [Conf] - Frank Gurski
**Characterizations for co-graphs defined by restricted NLC-width or clique-width operations.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:2, pp:271-277 [Journal] - Frank Gurski
**Linear layouts measuring neighbourhoods in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:15, pp:1637-1650 [Journal] - Frank Gurski, Egon Wanke
**A local characterization of bounded clique-width for line graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:6, pp:756-759 [Journal] - Wolfgang Espelage, Frank Gurski, Egon Wanke
**Deciding Clique-Width for Graphs of Bounded Tree-Width.**[Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 2003, v:7, n:2, pp:141-180 [Journal] - Frank Gurski, Egon Wanke
**On the relationship between NLC-width and linear NLC-width.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:347, n:1-2, pp:76-89 [Journal] - Frank Gurski, Egon Wanke
**Vertex disjoint paths on clique-width bounded graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:359, n:1-3, pp:188-199 [Journal] - Frank Gurski
**Characterizations for restricted graphs of NLC-width 2.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:372, n:1, pp:108-114 [Journal] - Frank Gurski
**Graph Operations on Clique-Width Bounded Graphs**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Frank Gurski
**Polynomial algorithms for protein similarity search for restricted mRNA structures**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Frank Gurski
**A note on module-composed graphs**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **The Clique-Width of Tree-Power and Leaf-Power Graphs.**[Citation Graph (, )][DBLP]**On Module-Composed Graphs.**[Citation Graph (, )][DBLP]**A comparison of two approaches for polynomial time algorithms computing basic graph parameters**[Citation Graph (, )][DBLP]**Graph parameters measuring neighbourhoods in graphs - Bounds and applications.**[Citation Graph (, )][DBLP]**The NLC-width and clique-width for powers of graphs of bounded tree-width.**[Citation Graph (, )][DBLP]**Line graphs of bounded clique-width.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |