SPQR tree

Results: 13



#Item
1UNIVERSITÄT DORTMUND  FACHBEREICH INFORMATIK Diplomarbeit

UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit

Add to Reading List

Source URL: ls11-www.cs.tu-dortmund.de

Language: English - Date: 2008-07-03 09:38:15
2On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs ? M. A. Bekos1 , S. Cornelsen2 , L. Grilli3 , S.-H. Hong4 , M. Kaufmann1 1  arXiv:1409.0461v1 [cs.CG] 1 Sep 2014

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs ? M. A. Bekos1 , S. Cornelsen2 , L. Grilli3 , S.-H. Hong4 , M. Kaufmann1 1 arXiv:1409.0461v1 [cs.CG] 1 Sep 2014

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-09-01 21:12:43
3Beyond Planarity: Testing Full Outer-2-Planarity in Linear Time Seok-Hee Hong1 and Hiroshi Nagamochi2 1  University of Sydney, Australia

Beyond Planarity: Testing Full Outer-2-Planarity in Linear Time Seok-Hee Hong1 and Hiroshi Nagamochi2 1 University of Sydney, Australia

Add to Reading List

Source URL: www.amp.i.kyoto-u.ac.jp

Language: English - Date: 2014-09-07 19:39:32
4A Linear-Time Algorithm for Testing Outer-1-Planarity? Seok-Hee Hong1 , Peter Eades1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1

A Linear-Time Algorithm for Testing Outer-1-Planarity? Seok-Hee Hong1 , Peter Eades1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1

Add to Reading List

Source URL: www.cs.usyd.edu.au

Language: English
5Two-page Book Embedding and Clustered Graph Planarity Seok-Hee Hong1 Hiroshi Nagamochi2  1

Two-page Book Embedding and Clustered Graph Planarity Seok-Hee Hong1 Hiroshi Nagamochi2 1

Add to Reading List

Source URL: www-or.amp.i.kyoto-u.ac.jp

Language: English - Date: 2013-01-30 20:33:55
6Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms David F. Gleich Computer Science Department Purdue University West Lafayette, IN

Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms David F. Gleich Computer Science Department Purdue University West Lafayette, IN

Add to Reading List

Source URL: www.stat.berkeley.edu

Language: English - Date: 2015-06-08 10:54:36
7WSDM 2013 Data Challenge  Warning: This document is to be considered a draft until August 31, 2012. After that date, the final version will be realeased, along with all the data needed for the competition.

WSDM 2013 Data Challenge Warning: This document is to be considered a draft until August 31, 2012. After that date, the final version will be realeased, along with all the data needed for the competition.

Add to Reading List

Source URL: wsdm2013.org

Language: English - Date: 2013-09-30 17:55:49
8A Tighter Insertion-based Approximation of the Crossing Number Markus Chimani⋆1 and Petr Hlinˇen´ y⋆⋆ 2 1

A Tighter Insertion-based Approximation of the Crossing Number Markus Chimani⋆1 and Petr Hlinˇen´ y⋆⋆ 2 1

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2011-05-24 08:45:38
9Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace

Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2014-04-18 22:07:45
10Piggybacking on Social Networks∗ Aristides Gionis Flavio Junqueira  Vincent Leroy

Piggybacking on Social Networks∗ Aristides Gionis Flavio Junqueira Vincent Leroy

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-06-29 06:26:37