[ ] FO Model Checking of Interval Graphs
arxiv.org
Title: FO Model Checking of Interval Graphs. Authors: Robert Ganian (Vienna University of Technology), Petr Hlineny (Masaryk University, Brno), Daniel Kral (University of Warwick), Jan Obdrzalek (Masaryk University, Brno), Jarett Schwartz (UC Berkeley), Jakub Teska (University of West Bohemia, Pilsen).
CiteSeerX — On the crossing number of almost planar graphs
citeseerx.ist.psu.edu
BibTeX @INPROCEEDINGS{Hlineny06onthe, author = {Petr Hlineny and Gelasio Salazar}, title = {On the crossing number of almost planar graphs}, booktitle = {IN PROC.
Improved Upper Bounds on the Crossing Number - User ...
users.monash.edu.au
crossing number of Cm × Cn is as conjectured for n ≥ m(m + 1). J. Graph Theory, 47(1):53–72, [21] Petr Hlineny. Crossing-number critical graphs have.
The Minor Crossing Number of Graphs with an User Web Pages
users.monash.edu.au
[18] Petr Hlineny. Crossing-number critical graphs have bounded path-width. J. Combin. Theory Ser. B, 88(2):347–367, MR , Zbl
A lower bound for the tree-width of planar graphs with vital ...
www.tdi.informatik.uni-frankfurt.de
[5] Petr Hlineny, Sang il Oum, Detlef Seese, and Georg Gottlob. Width param- eters beyond tree-width and their applications. Computer Journal ...
Crossing-Critical Graphs have Bounded Path-Width by Petr Hlineny
at.yorku.ca
Crossing-Critical Graphs have Bounded Path-Width by. Petr Hlineny Victoria University. The crossing number of a graph G, denoted by cr(G), is defined as the ...
Approximating the Crossing Number of toroidal graphs - CORE
core.ac.uk
By Petr Hlineny and Gelasio Salazar. Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory,
Crossing-Number Critical Graphs have Bounded Path-width - CORE
core.ac.uk
By Petr Hlineny. Abstract. The crossing number of a graph G, denoted by cr(G), ...
All web results to the name "Petr Hlineny"
2014 International Workshop on Structure in Graphs and Matroids | The...
matroidunion.org
2014 International Workshop on Structure in Graphs and ... Neil Robertson, Nick Brettell, Paul Seymour, Peter Nelson, Petr Hlineny, Reinhard Diestel, Rhiannon
First order limits of sparse graphs: Plane trees and path-width
scirate.com
Petr Hlineny, Tomas Kaiser, Daniel Kral, Martin Kupec, Jan Obdrzalek, Sebastian Ordyniak, Vojtech Tuma; Nesetril and Ossona de Mendez introduced the notion of first
Gelasio Salazar
www.ifisica.uaslp.mx
Gelasio Salazar Instituto de Fisica ... Toroidal Grid Minors and Stretch in Embedded Graphs (with Markus Chimani and Petr Hlineny), submitted (2014).
CiteSeerX — Citation Query Contact graphs of curves ...
citeseer.uark.edu
by Petr Hlineny, Jan Kratochvíl " Practical applications, like radio frequency assignments, led to the denition of disk
Fields Institute - Programs-Thematic -Graph Theory & Optimization
www.fields.utoronto.ca
Petr Hlineny , The Fields Institute. Abstract: The discharging method is a powerful tool for dealing with graphs embedded on some surface (often just planar graphs). Probably the best known application of this technique is the "unavoidability" part in the proof of the Four Colour Theorem (Appel, Haken / Robertson, Sanders, ...
[TYPES/announce] MFCS accepted papers
lists.seas.upenn.edu
MFCS accepted papers Viliam ... to exponential products Rodrigo Leo and Valmir Barbosa. Minimal Chordal Sense of Direction and Circulant Graphs Petr Hlineny.
GD Accepted Papers
gd2006.iti.kit.edu
Thickness of Bar 1-Visibility Graphs; Petr Hlineny and Gelasio Salazar. On the Crossing Number of Almost Planar Graphs; Bruno Pinaud, Pascale Kuntz and ...
Related search requests for Petr Hlineny
| Robert Ganian Jaroslav Nesetril Petra Mutzel | Gelasio Salazar James Oxley Markus Chimani | Peter Rossmanith Tomas Kaiser Daniel Kral |
People Forename "Petr" (4508) Name "Hlineny" (1) |
sorted by relevance / date