( en | de | ru )

 

Disambiguation of "Miltzow, Tillmann"

Author of the publication

copydeleteadd this publication to your clipboard
Fine-Grained Complexity of Coloring Unit Disks and Balls.

, , , , and . Symposium on Computational Geometry, volume 77 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tillmann Miltzow

Karl Miltzow

Tillmann Hemminger

Strategische Planung in Tochtergesellschaften multinationaler Unternehmen in China: eine empirische Analyse des intra-organisatorischen Wissenstransfers. Uni Regensburg, (2009)

Tillmann Wagner

Tillmann Schwörer

 

Other publications of authors with the same name

Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings, , and . CoRR, (2013)Representing Matroids over the Reals is ∃R-complete., , and . CoRR, (2023)The art gallery problem is ∃ ℝ-complete., , and . STOC, page 65-73. ACM, (2018)Upper and Lower Bounds on Long Dual Paths in Line Arrangements., , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 407-419. Springer, (2015)∀∃ℝ-Completeness and Area-Universality., , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 164-175. Springer, (2018)Tight Exact and Approximate Algorithmic Results on Token Swapping., , , , , and . CoRR, (2016)On Classifying Continuous Constraint Satisfaction problems., and . FOCS, page 781-791. IEEE, (2021)Framework for ∃R-Completeness of Two-Dimensional Packing Problems., , and . CoRR, (2020)Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems., and . SoCG, volume 51 of LIPIcs, page 52:1-52:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Complexity of Drawing a Graph in a Polygonal Region., , and . GD, volume 11282 of Lecture Notes in Computer Science, page 387-401. Springer, (2018)