From post

Coloring and Recognizing Mixed Interval Graphs

, , , , , и . Proc. 34th Annu. Int. Symp. Algorithms Comput. (ISAAC'23), том 283 из LIPIcs, стр. 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.

 

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

Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints., и . CoRR, (2016)Graph polynomials and group coloring of graphs., , , , и . Eur. J. Comb., (2022)Chip Games and Paintability., , и . Electron. J. Comb., 23 (3): 3 (2016)Coloring and Recognizing Directed Interval Graphs., , , , , и . CoRR, (2023)Lower Bounds for On-line Graph Colorings., , , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 507-515. Springer, (2014)Online Coloring of Short Intervals., , , , и . CoRR, (2018)Coloring and Recognizing Mixed Interval Graphs, , , , , и . Proc. 34th International Symposium on Algorithms and Computation (ISAAC'23), стр. 36:1--36:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2023)Defective 3-Paintability of Planar Graphs., , , и . Electron. J. Comb., 25 (2): 2 (2018)Online Coloring of Short Intervals., , , , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 52:1-52:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints., и . SOFSEM, том 10139 из Lecture Notes in Computer Science, стр. 325-335. Springer, (2017)