( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
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)
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.

Konstanty Bogdanski

Jan Szaniawski

Ewald Konstanty

Konstanty Marek Gawrylczyk

Konstanty Marek Gawrylczyk

 

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

Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique., , , , , , , и . CoRR, (2014)Game chromatic number of graphs with locally bounded number of cycles., и . Inf. Process. Lett., 110 (17): 757-760 (2010)Exact and approximation algorithms for sensor placement against DDoS attacks., , и . FedCSIS, том 21 из Annals of Computer Science and Information Systems, стр. 295-301. (2020)Travel Time Prediction for Trams in Warsaw., , и . CORES, том 578 из Advances in Intelligent Systems and Computing, стр. 53-62. (2017)Game-Theoretic Approach to Attack Planning and Controller Placement in Software Defined Networks., и . ICMCIS, стр. 1-8. IEEE, (2023)An Exact Algorithm for the Generalized List $T$-Coloring Problem., и . CoRR, (2013)Homothetic polygons and beyond: Maximal cliques in intersection graphs., , , , , , , и . Discret. Appl. Math., (2018)On the number of 2-packings in a connected graph., и . Discret. Math., 312 (23): 3444-3450 (2012)Upper Bound on the Circular Chromatic Number of the Plane.. Electron. J. Comb., 25 (1): 1 (2018)Coloring of G2-G, for Euclidesian graph G.. Discussiones Mathematicae Graph Theory, 25 (1-2): 219 (2005)