Prati
Torsten Ueckerdt
Torsten Ueckerdt
Potvrđena adresa e-pošte na kit.edu - Početna stranica
Naslov
Citirano
Citirano
Godina
Cycle bases in graphs characterization, algorithms, complexity, and applications
T Kavitha, C Liebchen, K Mehlhorn, D Michail, R Rizzi, T Ueckerdt, ...
Computer Science Review 3 (4), 199-243, 2009
2312009
Planar graphs have bounded queue-number
V Dujmović, G Joret, P Micek, P Morin, T Ueckerdt, DR Wood
Journal of the ACM (JACM) 67 (4), 1-38, 2020
1262020
Computing cartograms with optimal complexity
MJ Alam, T Biedl, S Felsner, M Kaufmann, SG Kobourov, T Ueckerdt
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
912012
The density of fan-planar graphs
M Kaufmann, T Ueckerdt
arXiv preprint arXiv:1403.6184, 2014
602014
Edge-intersection graphs of grid paths: the bend-number
D Heldt, K Knauer, T Ueckerdt
Discrete Applied Mathematics 167, 144-162, 2014
562014
Four pages are indeed necessary for planar graphs
MA Bekos, M Kaufmann, F Klute, S Pupyrev, C Raftopoulou, T Ueckerdt
arXiv preprint arXiv:2004.07630, 2020
482020
Planar graphs as VPG-graphs
S Chaplick, T Ueckerdt
Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013
452013
Three ways to cover a graph
K Knauer, T Ueckerdt
Discrete Mathematics 339 (2), 745-758, 2016
402016
Semantic word cloud representations: Hardness and approximation algorithms
L Barth, SI Fabrikant, SG Kobourov, A Lubiw, M Nöllenburg, Y Okamoto, ...
Latin American Symposium on Theoretical Informatics, 514-525, 2014
392014
Intersection graphs of L-shapes and segments in the plane
S Felsner, K Knauer, GB Mertzios, T Ueckerdt
Discrete Applied Mathematics 206, 48-55, 2016
342016
On the bend-number of planar and outerplanar graphs
D Heldt, K Knauer, T Ueckerdt
Discrete Applied Mathematics 179, 109-119, 2014
342014
An improved planar graph product structure theorem
T Ueckerdt, D Wood, W Yi
The Electronic Journal of Combinatorics, P2. 51-P2. 51, 2022
292022
How to eat 4/9 of a pizza
K Knauer, P Micek, T Ueckerdt
Discrete Mathematics 311 (16), 1635-1645, 2011
292011
Combinatorial and geometric properties of planar Laman graphs
S Kobourov, T Ueckerdt, K Verbeek
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
282013
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
A Asinowski, J Cardinal, N Cohen, S Collette, T Hackl, M Hoffmann, ...
Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013
262013
Geometric representations of graphs with low polygonal complexity
T Ueckerdt
242012
Making octants colorful and related covering decomposition problems
J Cardinal, K Knauer, P Micek, T Ueckerdt
SIAM journal on discrete mathematics 28 (4), 1948-1959, 2014
222014
Equilateral L-contact graphs
S Chaplick, SG Kobourov, T Ueckerdt
Graph-Theoretic Concepts in Computer Science: 39th International Workshop …, 2013
222013
Making triangles colorful
J Cardinal, K Knauer, P Micek, T Ueckerdt
arXiv preprint arXiv:1212.2346, 2012
202012
Induced and weak induced arboricities
M Axenovich, P Dörr, J Rollin, T Ueckerdt
Discrete Mathematics 342 (2), 511-519, 2019
192019
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20