Author of the publication

Coloring and Recognizing Mixed Interval Graphs

, , , , , and . Proc. 34th International Symposium on Algorithms and Computation (ISAAC'23), page 36:1--36:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2023)
DOI: 10.4230/LIPIcs.ISAAC.2023.36

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.

 

Other publications of authors with the same name

Computing Optimal Tangles Faster, , , , and . Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19), page 61:1-7. (2019)Robust gateway placement for scalable lorawan, , , , and . 2021 13th IFIP Wireless and Mobile Networking Conference (WMNC), page 71--78. IEEE, (2021)Recognizing Stick Graphs with and without Length Constraints., , , , , , and . J. Graph Algorithms Appl., 24 (4): 657-681 (2020)Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192)., , and . Dagstuhl Reports, 9 (5): 31-57 (2019)Algorithms for Floor Planning with Proximity Requirements., , and . CAAD Futures, volume 1465 of Communications in Computer and Information Science, page 151-171. Springer, (2021)Cover Contact Graphs., , , , , , , , , and 4 other author(s). GD, volume 4875 of Lecture Notes in Computer Science, page 171-182. Springer, (2007)Coloring Mixed and Directional Interval Graphs., , , , , and . GD, volume 13764 of Lecture Notes in Computer Science, page 418-431. Springer, (2022)Coloring and Recognizing Mixed Interval Graphs., , , , , and . ISAAC, volume 283 of LIPIcs, page 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Improved Approximation Algorithms for Box Contact Representations, , , , , , , and . Algorithmica, (2016)Beyond Outerplanarity, , , , and . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), Springer-Verlag, (2017)