( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps

, , , и . Proc. 14th Int. Sympos. Graph Drawing (GD'06), том 4372 из Lecture Notes in Computer Science, стр. 270--281. Springer-Verlag, (2007)
DOI: 10.1007/978-3-540-70904-6_27

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.

Uno Pesonen

Petra Unold

Uno Kaur

Denzo Uno

Wolfram Unold

 

Другие публикации лиц с тем же именем

Efficient algorithms for dualizing large-scale hypergraphs., и . ALENEX, стр. 1-13. SIAM, (2013)A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , и . CoRR, (2014)Probabilistic Prediction of Student Affect from Hand Gestures., , , и . ARCS, стр. 58-63. ISRST, (2008)Efficient Enumeration of Dominating Sets for Sparse Graphs., , , и . ISAAC, том 123 из LIPIcs, стр. 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Ladder-Lottery Realization., , , и . CCCG, стр. 61-67. (2018)Listing Chordal Graphs and Interval Graphs., , и . WG, том 4271 из Lecture Notes in Computer Science, стр. 68-77. Springer, (2006)Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width., и . TAMC, том 6648 из Lecture Notes in Computer Science, стр. 483-494. Springer, (2011)Transforming spanning trees: A lower bound., , , и . Comput. Geom., 42 (8): 724-730 (2009)On listing, sampling, and counting the chordal graphs with edge constraints., , , и . Theor. Comput. Sci., 411 (26-28): 2591-2601 (2010)A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number., , , и . Theor. Comput. Sci., (2021)