Author of the publication

Complexity of Conjunctive Regular Path Query Homomorphisms.

, , , , and . CiE, volume 11558 of Lecture Notes in Computer Science, page 108-119. Springer, (2019)

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

Parameterized and approximation complexity of Partial VC Dimension., , and . Theor. Comput. Sci., (2019)Complexity of Conjunctive Regular Path Query Homomorphisms., , , , and . CiE, volume 11558 of Lecture Notes in Computer Science, page 108-119. Springer, (2019)Identifying codes in bipartite graphs of given maximum degree., , and . LAGOS, volume 223 of Procedia Computer Science, page 157-165. Elsevier, (2023)Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover., , , , , , and . ICALP, volume 297 of LIPIcs, page 66:1-66:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On locating and neighbor-locating colorings of sparse graphs., , , , and . Discret. Appl. Math., (2024)New Bounds and Constructions for Neighbor-Locating Colorings of Graphs., , , , and . CALDAM, volume 13947 of Lecture Notes in Computer Science, page 121-133. Springer, (2023)Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs., , , and . CALDAM, volume 13947 of Lecture Notes in Computer Science, page 297-308. Springer, (2023)Complexity of planar signed graph homomorphisms to cycles., , , , and . Discret. Appl. Math., (2020)Monitoring the edges of a graph using distances., , , , and . CoRR, (2020)Algorithms and Hardness for Metric Dimension on Digraphs., , and . WG, volume 14093 of Lecture Notes in Computer Science, page 232-245. Springer, (2023)