Torsten Ueckerdt - Google Scholar Citations

Cited by

	All	Since 2015
Citations	693	539
h-index	15	13
i10-index	19	17

140

105

2009201020112012201320142015201620172018201920203 10 14 19 39 48 94 74 105 91 122 49

Co-authors

Stephen KobourovProfessor of Computer Science, University of ArizonaVerified email at cs.arizona.edu
Michael KaufmannProfessor of Computer Science, Tübingen UniversityVerified email at informatik.uni-tuebingen.de
Muhammad Jawaherul AlamPh.D., Computer Science, University of ArizonaVerified email at cs.arizona.edu
Sergey PupyrevFacebookVerified email at uran.ru
Jean CardinalUniversité libre de Bruxelles (ULB)Verified email at ulb.ac.be
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgVerified email at uni-wuerzburg.de
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
David EppsteinChancellor's Professor of Computer Science, University of California, IrvineVerified email at uci.edu
Therese BiedlUniversity of WaterlooVerified email at cs.uwaterloo.ca
Andre SchulzProfessor of CSVerified email at fernuni-hagen.de
Martin NöllenburgAssociate Professor, Algorithms and Complexity Group, TU WienVerified email at ac.tuwien.ac.at
George B. MertziosAssociate Professor, Durham UniversityVerified email at durham.ac.uk
Kevin VerbeekAssistant Professor, Mathematics and Computer Science, TU EindhovenVerified email at tue.nl
Sara Irina FabrikantProfessor of Geography (GIScience)Verified email at geo.uzh.ch
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooVerified email at uwaterloo.ca
Claudio SquarcellaNetwork Visualization at ThousandEyesVerified email at dia.uniroma3.it
Yoshio OkamotoUniversity of Electro-CommunicationsVerified email at uec.ac.jp
Stefan LangermanDépartement d'Informatique, Université Libre de BruxellesVerified email at ulb.ac.be
Michał LasońInstitute of Mathematics of the Polish Academy of SciencesVerified email at impan.pl
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaVerified email at kam.mff.cuni.cz

Torsten Ueckerdt

Karlsruhe Institute of Technology

Verified email at kit.edu - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	151	2009
Computing cartograms with optimal complexity MJ Alam, T Biedl, S Felsner, M Kaufmann, SG Kobourov, T Ueckerdt Discrete & Computational Geometry 50 (3), 784-810, 2013	65	2013
Edge-intersection graphs of grid paths: the bend-number D Heldt, K Knauer, T Ueckerdt Discrete Applied Mathematics 167, 144-162, 2014	44	2014
Planar graphs as VPG-graphs S Chaplick, T Ueckerdt International Symposium on Graph Drawing, 174-186, 2012	34	2012
The density of fan-planar graphs M Kaufmann, T Ueckerdt arXiv preprint arXiv:1403.6184, 2014	30	2014
On the bend-number of planar and outerplanar graphs D Heldt, K Knauer, T Ueckerdt Discrete Applied Mathematics 179, 109-119, 2014	26	2014
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	25	2016
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	21	2013
How to eat 4/9 of a pizza K Knauer, P Micek, T Ueckerdt Discrete Mathematics 311 (16), 1635-1645, 2011	21	2011
Planar graphs have bounded queue-number V Dujmovic, G Joret, P Micek, P Morin, T Ueckerdt, D Wood 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019	20*	2019
Three ways to cover a graph K Knauer, T Ueckerdt Discrete Mathematics 339 (2), 745-758, 2016	20	2016
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	19*	2014
Geometric representations of graphs with low polygonal complexity T Ueckerdt	19	2012
Equilateral L-contact graphs S Chaplick, SG Kobourov, T Ueckerdt International Workshop on Graph-Theoretic Concepts in Computer Science, 139-151, 2013	18	2013
Splitting planar graphs of girth 6 into two linear forests with short paths M Axenovich, T Ueckerdt, P Weiner Journal of Graph Theory 85 (3), 601-618, 2017	17	2017
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	15	2014
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles A Asinowski, J Cardinal, N Cohen, S Collette, T Hackl, M Hoffmann, ... Workshop on Algorithms and Data Structures, 73-84, 2013	15	2013
Making triangles colorful J Cardinal, K Knauer, P Micek, T Ueckerdt arXiv preprint arXiv:1212.2346, 2012	15	2012
Contact representations of graphs in 3D J Alam, W Evans, S Kobourov, S Pupyrev, J Toeniskoetter, T Ueckerdt Workshop on Algorithms and Data Structures, 14-27, 2015	11	2015
Conditions on Ramsey nonequivalence M Axenovich, J Rollin, T Ueckerdt Journal of Graph Theory 86 (2), 159-192, 2017	7	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors