Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Matou{\v{s}}ek, Ji{\v{r}}{\'{i}}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing all maps into a sphere
Martin C̑adek
,
Marek Krc̑ál
,
Jiȓí Matous̑ek
,
Francis Sergeraert
,
Lukás̑ Vokȓínek
,
Uli Wagner
Journal of the ACM
61
(3), 2014, pp. 17: 1-44
Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
Martin C̑adek
,
Marek Krc̑ál
,
Jiȓí Matous̑ek
,
Lukás Vokȓínek
,
Uli Wagner
SIAM Journal on Computing
43
(5), 2014, pp. 1728-1780
Lower bounds on geometric Ramsey functions
Marek Eliás̑
,
Jiȓí Matous̑ek
,
Edgard Roldán-Pensado
,
Zuzana Safernová
SIAM Journal on Discrete Mathematics
28
(4), 2014, pp. 1960-1970
On range searching with semialgebraic sets. II
Pankaj K. Agarwal
,
Jiȓí Matous̑ek
,
Micha Sharir
SIAM Journal on Computing
42
(6), 2013, pp. 2039-2062
Extending continuous maps: Polynomiality and undecidability
Martin C̑adek
,
Marek Krc̑ál
,
Jiȓí Matous̑ek
,
Lukás̑ Vokȓínek
,
Uli Wagner
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 595-604
Untangling two systems of noncrossing curves
Jiȓí Matous̑ek
,
Eric Sedgwick
,
Martin Tancer
,
Uli Wagner
Lecture Notes in Computer Science
8242
, 2013, pp. 472-483
Higher-order Erdŏs-Szekeres theorems
Marek Eliás̑
,
Jiȓí Matous̑ek
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 81-89
Minimum and maximum against
k
lies
Michael Hoffmann
,
Jiȓí Matous̑ek
,
Yoshio Okamoto
,
Philipp Zumstein
Lecture Notes in Computer Science
6139
, 2010, pp. 139-149
How many points can be reconstructed from
k
projections?
Jiȓí Matous̑ek
,
Ales̑ Pȓívȇtivý
,
Petr S̑kovron̑
SIAM Journal on Discrete Mathematics
22
(4), 2008, pp. 1605-1623
Large monochromatic components in two-colored grids
Jiȓí Matous̑ek
,
Ales̑ Pȓívȇtivý
SIAM Journal on Discrete Mathematics
22
(1), 2008, pp. 295-311
Zone diagrams: Existence, uniqueness, and algorithmic challenge
Tetsuo Asano
,
Jiȓí Matous̑ek
,
Takeshi Tokuyama
SIAM Journal on Computing
37
(4), 2007, pp. 1182-1198
Quadratically many colorful simplices
Imre Bárány
,
Jiȓí Matous̑ek
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 191-198
The distance trisector curve
Tetsuo Asano
,
Jiȓí Matous̑ek
,
Takeshi Tokuyama
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 336-343
Online conflict-free coloring for intervals
Ke Chen
,
Amos Fiat
,
Haim Kaplan
,
Meital Levy
,
Jiȓí Matous̑ek
,
Elchanan Mossel
,
János Pach
,
Micha Sharir
,
Shakhar Smorodinsky
,
Uli Wagner
,
Emo Welzl
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1342-1359
Violator spaces: Structure and algorithms
Bernd Gärtner
,
Jiȓí Matous̑ek
,
Leo Rüst
,
Petr S̑kovron̑
Lecture Notes in Computer Science
4168
, 2006, pp. 387-398
The number of unique-sink orientations of the hypercube
Jiȓí Matous̑ek
Combinatorica
26
(1), 2006, pp. 91-99
Towards asymptotic optimality in probabilistic packet marking
Micah Adler
,
Jeff Edmonds
,
Jiȓí Matous̑ek
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 450-459
Discrepancy after adding a single set
Jeong Han Kim
,
Jiȓí Matous̑ek
,
Van H. Vu
Combinatorica
25
(4), 2005, pp. 499-501
A combinatorial proof of Kneser's conjecture
Jiȓí Matous̑ek
Combinatorica
24
(1), 2004, pp. 163-170
Low-distortion embeddings of trees
Robert Babilon
,
Jiȓí Matous̑ek
,
Jana Maxová
,
Pavel Valtr
Lecture Notes in Computer Science
2265
, 2002, pp. 343-351
A lower bound for families of Natarajan dimension
d
Paul Fischer
,
Jiȓí Matous̑ek
Journal of Combinatorial Theory Series A
95
(1), 2001, pp. 189-195
On the signed domination in graphs
Jiȓí Matous̑ek
Combinatorica
20
(1), 2000, pp. 103-108
Product range spaces, sensitive sampling, and derandomization
Hervé Brönnimann
,
Bernard Chazelle
,
Jiȓí Matous̑ek
SIAM Journal on Computing
28
(5), 1999, pp. 1552-1575
The anatomy of a geometric algorithm
Jiȓí Matous̑ek
Lecture Notes in Computer Science
1731
, 1999, pp. 1-7
Constructing levels in arrangements and higher order Voronoi diagrams
Pankaj K. Agarwal
,
Mark de Berg
,
Jiȓí Matous̑ek
,
Otfried Schwarzkopf
SIAM Journal on Computing
27
(3), 1998, pp. 654-667
Seiten 1
2
>