( en | de | ru )

 

Disambiguation of "Lidický, Bernard"

Author of the publication

copydeleteadd this publication to your clipboard
Notes on complexity of packing coloring.

, , , and . CoRR, (2017)

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.

Dirk Bernard

Bernard Broermann

Bernard Andreae

Bernard Willkofer

Bernard Schmidtmann

 

Other publications of authors with the same name

On the Tree Search Problem with Non-uniform Costs., , , , and . WG, volume 9224 of Lecture Notes in Computer Science, page 90-102. Springer, (2015)L(2, 1, 1)-Labeling Is NP-Complete for Trees., , and . TAMC, volume 6108 of Lecture Notes in Computer Science, page 211-221. Springer, (2010)5-Coloring Graphs with 4 Crossings., , , and . SIAM J. Discret. Math., 25 (1): 401-422 (2011)Closing in on Hill's Conjecture., , and . SIAM J. Discret. Math., 33 (3): 1261-1276 (2019)The k-in-a-Path Problem for Claw-free Graphs., , , and . Algorithmica, 62 (1-2): 499-519 (2012)The k-in-a-path problem for claw-free graphs, , , and . CoRR, (2009)On tripartite common graphs., , , and . Comb. Probab. Comput., 31 (5): 907-923 (2022)Irreversible 2-conversion set in graphs of bounded degree., , and . Discret. Math. Theor. Comput. Sci., (2017)Graphs with Two Crossings Are 5-Choosable., , and . SIAM J. Discret. Math., 25 (4): 1746-1753 (2011)On facial unique-maximum (edge-)coloring., , , and . Discret. Appl. Math., (2018)