Project information
Graph Drawings and Representations
(GraDR)
- Project Identification
- GEGIG/11/E023
- Project Period
- 3/2011 - 12/2013
- Investor / Pogramme / Project type
-
Czech Science Foundation
- Eurocores
- MU Faculty or unit
- Faculty of Informatics
- Cooperating Organization
-
Charles University
- Responsible person prof. RNDr. Jan Kratochvíl, CSc.
The main goal of this CRP is to foster collaborative research in the areas of graph drawing and geometric representations of graphs, and by coordinating and unifying the efforts of top European research groups to attack basic and notoriously difficult open problems in the area. Twenty years ago when the Graph Drawing symposium series was established by di Battista et al., the field was small and encompassed a limited number of researchers. Due to its appeal and growing importance many people from the discrete mathematics and theoretical computer science communities found their way into graph drawing. The annual symposia show how the area has flourished. They also clearly show that research is scattered over different teams, fragmented over potentially interconnected topics, and often inefficiently duplicated. Now – better than ever – is the time ripe for unifying the forces to efficiently and seriously attack prevailing difficult and important problems, open new territories and significantly push the frontiers of our knowledge. EUROGIGA offers a unique chance for such coordination of research efforts. Incorporating young researchers and students in the research teams will help achieve the second main goal of this CRP: the transfer of our know-how to the next generation.
Publications
Total number of publications: 9
2014
-
Computing the stretch of an embedded graph
SIAM Journal on Discrete Mathematics, year: 2014, volume: 28, edition: 3, DOI
2013
-
Computing the Stretch of an Embedded Graph
XV Spanish Meeting on Computational Geometry, year: 2013
-
How Not to Characterize Planar-emulable Graphs
Advances in Applied Mathematics, year: 2013, volume: 50, edition: 1, DOI
2012
-
GraDR 2012 Crossing Number Workshop and Minischool
Year: 2012, type: Workshop
-
Vertex insertion approximates the crossing number of apex graphs
European Journal of Combinatorics, year: 2012, volume: 33, edition: 3, DOI
2011
-
A Tighter Insertion-based Approximation of the Crossing Number
Automata, Languages and Programming 38th International Colloquium, ICALP 2011, year: 2011
-
A Tighter Insertion-based Approximation of the Graph Crossing Number
Year: 2011, type:
-
How Not to Characterize Planar-emulable Graphs
COMBINATORIAL ALGORITHMS, Lecture Notes in Computer Science 7056, year: 2011
-
New Development in Planar Emulators
Year: 2011, type: