( en | de | ru )

 

Disambiguation of "Stefankovic, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Spiralling and Folding: The Topological View.

, , and . CCCG, page 73-76. Carleton University, Ottawa, Canada, (2007)

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.

Daniel

Daniel

Daniel Stanze

Systematische Analyse von Rezeptoren und Effektormechanismen der pulmonalen angeborenen Immunität. Uni Marburg, (2009)

Daniel Wied

Zivilprozessuale Qualifikationsprobleme im Spannungsfeld von Vertrag und Delikt: ein Beitrag zur Auslegung nationalen Zivilprozessrechts in europäischer Perspektive. Uni Regensburg, (2009)

Daniel Dirkmann

In-vitro-Untersuchungen zum Effekt von Hypothermie und Azidose auf Variablen thrombelastometrischer Messungen der Blutgerinnung. Uni Duisburg-Essen, (2009)
 

Other publications of authors with the same name

Sampling Random Colorings of Sparse Random Graphs., , , and . SODA, page 1759-1771. SIAM, (2018)Spatial mixing and the connective constant: Optimal bounds., , , and . SODA, page 1549-1563. SIAM, (2015)Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region., , , and . SODA, page 2198-2207. SIAM, (2022)Spiraling and Folding: The Topological View., , , and . CoRR, (2022)Removing even crossings on surfaces., , and . Eur. J. Comb., 30 (7): 1704-1717 (2009)Spiraling and Folding: The Word View., , and . Algorithmica, 60 (3): 609-626 (2011)On the complexity of multi-dimensional interval routing schemes., and . Theor. Comput. Sci., 245 (2): 255-280 (2000)Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs., , , and . ICALP, volume 229 of LIPIcs, page 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees., , , , and . SODA, page 945-956. SIAM, (2011)The Complexity of Approximating the Matching Polynomial in the Complex Plane., , , and . ACM Trans. Comput. Theory, 13 (2): 13:1-13:37 (2021)