Torsten Ueckerdt 个人学术档案

引用次数

	总计	2019 年至今
引用	1409	864
h 指数	19	15
i10 指数	33	23

200

100

150

20092010201120122013201420152016201720182019202020212022202320244 8 17 29 45 50 92 81 104 90 104 151 161 149 200 94

开放获取的出版物数量

查看全部

26 篇文章

1 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Stephen KobourovProfessor of Computer Science, University of Arizona在 cs.arizona.edu 的电子邮件经过验证
Michael KaufmannProfessor of Computer Science, Tübingen University在 informatik.uni-tuebingen.de 的电子邮件经过验证
Sergey PupyrevApplied Research在 uran.ru 的电子邮件经过验证
Muhammad Jawaherul AlamPh.D., Computer Science, University of Arizona在 cs.arizona.edu 的电子邮件经过验证
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg在 uni-wuerzburg.de 的电子邮件经过验证
Jean CardinalUniversité libre de Bruxelles (ULB)在 ulb.be 的电子邮件经过验证
David EppsteinDistinguished Professor of Computer Science, University of California, Irvine在 uci.edu 的电子邮件经过验证
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics Campus在 mpi-inf.mpg.de 的电子邮件经过验证
Therese BiedlUniversity of Waterloo在 cs.uwaterloo.ca 的电子邮件经过验证
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU Wien在 ac.tuwien.ac.at 的电子邮件经过验证
Sara Irina FabrikantProfessor of Geography (GIScience)在 geo.uzh.ch 的电子邮件经过验证
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of Waterloo在 uwaterloo.ca 的电子邮件经过验证
Claudio SquarcellaNetwork Visualization at ThousandEyes在 dia.uniroma3.it 的电子邮件经过验证
Yoshio OkamotoUniversity of Electro-Communications在 uec.ac.jp 的电子邮件经过验证
Andre SchulzProfessor of CS在 fernuni-hagen.de 的电子邮件经过验证
George B. MertziosAssociate Professor, Durham University在 durham.ac.uk 的电子邮件经过验证
Kevin VerbeekAssociate Professor, Mathematics and Computer Science, TU Eindhoven在 tue.nl 的电子邮件经过验证
Stefan LangermanDépartement d'Informatique, Université Libre de Bruxelles在 ulb.ac.be 的电子邮件经过验证
Michał LasońInstitute of Mathematics of the Polish Academy of Sciences在 impan.pl 的电子邮件经过验证
Jan Kratochvilprofessor, Charles university in Prague, Univerzita Karlova在 kam.mff.cuni.cz 的电子邮件经过验证

关注

Torsten Ueckerdt

Karlsruhe Institute of Technology

在 kit.edu 的电子邮件经过验证 - 首页


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	231	2009
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	125	2020
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	90	2012
The density of fan-planar graphs M Kaufmann, T Ueckerdt arXiv preprint arXiv:1403.6184, 2014	59	2014
Edge-intersection graphs of grid paths: the bend-number D Heldt, K Knauer, T Ueckerdt Discrete Applied Mathematics 167, 144-162, 2014	56	2014
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	47	2020
Planar graphs as VPG-graphs S Chaplick, T Ueckerdt Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013	45	2013
Three ways to cover a graph K Knauer, T Ueckerdt Discrete Mathematics 339 (2), 745-758, 2016	40	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	39	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	34	2016
On the bend-number of planar and outerplanar graphs D Heldt, K Knauer, T Ueckerdt Discrete Applied Mathematics 179, 109-119, 2014	32	2014
How to eat 4/9 of a pizza K Knauer, P Micek, T Ueckerdt Discrete Mathematics 311 (16), 1635-1645, 2011	29	2011
An improved planar graph product structure theorem T Ueckerdt, D Wood, W Yi The Electronic Journal of Combinatorics, P2. 51-P2. 51, 2022	28	2022
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	28	2013
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	26	2013
Geometric representations of graphs with low polygonal complexity T Ueckerdt	24	2012
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	22	2014
Equilateral L-contact graphs S Chaplick, SG Kobourov, T Ueckerdt Graph-Theoretic Concepts in Computer Science: 39th International Workshop …, 2013	22	2013
Making triangles colorful J Cardinal, K Knauer, P Micek, T Ueckerdt arXiv preprint arXiv:1212.2346, 2012	20	2012
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	19	2017

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用