Result 1 to 20 of 39 total
Accelerated bend minimization. (English)
J. Graph Algorithms Appl. 16, No. 3, 635-650 (2012).
1
Path-based supports for hypergraphs. (English)
J. Discrete Algorithms 14, 248-261 (2012).
2
Accelerated bend minimization. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 111-122 (2012).
3
Blocks of hypergraphs. Applied to hypergraphs and outerplanarity. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 201-211 (2011).
4
Path-based supports for hypergraphs. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 20-33 (2011).
5
More canonical ordering. (English)
J. Graph Algorithms Appl. 15, No. 1, 97-126 (2011).
6
Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21‒24, 2010. Revised selected papers. (English)
Lecture Notes in Computer Science 6502. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). xiv, 414~p. EUR~66.34 (2011).
7
Accelerated bend minimization (English)
Graph Drawing, 111-122 (2011).
8
Leftist canonical ordering. (English)
Eppstein, David (ed.) et al., Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22‒25, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11804-3/pbk). Lecture Notes in Computer Science 5849, 159-170 (2010).
9
Blocks of hypergraphs - applied to hypergraphs and outerplanarity (English)
IWOCA, 201-211 (2010).
10
Path-based supports for hypergraphs (English)
IWOCA, 20-33 (2010).
11
Phylogenetic graph models beyond trees. (English)
Discrete Appl. Math. 157, No. 10, 2361-2369 (2009).
12
Treelike comparability graphs. (English)
Discrete Appl. Math. 157, No. 8, 1711-1722 (2009).
13
Leftist canonical ordering (English)
Graph Drawing, 159-170 (2009).
14
Track assignment. (English)
J. Discrete Algorithms 5, No. 2, 250-261 (2007).
15
Completely connected clustered graphs. (English)
J. Discrete Algorithms 4, No. 2, 313-323 (2006).
16
Characterizing families of cuts that can be represented by axis-parallel rectangles. (English)
J. Graph Algorithms Appl. 9, No. 1, 99-115 (2005).
17
Characterizing families of cuts that can be represented by axis-parallel rectangles. (English)
Liotta, Giuseppe (ed.), Graph drawing. 11th international symposium, GD 2003, Perugia, Italy, September 21‒24, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20831-3/pbk). Lect. Notes Comput. Sci. 2912, 357-368 (2004).
18
Drawing graphs on two and three lines. (English)
J. Graph Algorithms Appl. 8, No. 2, 161-177 (2004).
19
Treelike comparability graphs: Characterization, recognition, and applications. (English)
Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21‒23, 2004. Revised papers. Berlin: Springer (ISBN 3-540-24132-9/pbk). Lecture Notes in Computer Science 3353, 46-57 (2004).
20
Result 1 to 20 of 39 total
Start
Contact
Print
General Help
