( en | de | ru )

 

Disambiguation of "Egri, László"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Intractability of Even Set and Shortest Vector Problem.

, , , , , , , and . Electron. Colloquium Comput. Complex., (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.

László Germán

László Révész

László Udvari

László Tarnói

László Rózsavölgyi

 

Other publications of authors with the same name

List H-Coloring a Graph by Removing Few Vertices., , and . Algorithmica, 78 (1): 110-146 (2017)The complexity of the list homomorphism problem for graphs, , , and . CoRR, (2009)Could Knowledge-Based Neural Learning be Useful in Developmental Robotics? The Case of Kbcc., , , , and . Int. J. Humanoid Robotics, 4 (2): 245-279 (2007)On Constraint Satisfaction Problems below P.. CSL, volume 12 of LIPIcs, page 203-217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization., , and . STACS, volume 96 of LIPIcs, page 27:1-27:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Complexity of the List Homomorphism Problem for Graphs., , , and . STACS, volume 5 of LIPIcs, page 335-346. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Space complexity of list H-colouring: a dichotomy., , , and . CoRR, (2013)Directed st-Connectivity Is Not Expressible in Symmetric Datalog., , and . ICALP (2), volume 5126 of Lecture Notes in Computer Science, page 172-183. Springer, (2008)List H-Coloring a Graph by Removing Few Vertices., , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 313-324. Springer, (2013)Space complexity of list H-coloring revisited: the case of oriented trees.. CoRR, (2015)