E-LIB Suche - Ergebnisse für: Egri, László

1

RainbowTag: a Fiducial Marker System with a New Color Segme..:

, In: 2022 International Conference on Connected Vehicle and Expo (ICCVE),

Egri, Laszlo ; Nabati, Hamid ; Yu, Jia Yuan - p. 1-6 , 2022

Link: https://doi.org/10.1109/..

2

Parameterized Intractability of Even Set and Shortest Vecto..:

Bhattacharyya, Arnab ; Bonnet, Édouard ; Egri, László...
Journal of the ACM. 68 (2021) 3 - p. 1-40 , 2021

Link: https://doi.org/10.1145/..

3

Parameterized Intractability of Even Set and Shortest Vecto..:

Bhattacharyya, Arnab ; Bonnet, Édouard ; Egri, László...
Journal of the ACM (JACM). 68 (2021) 3 - p. 1-40 , 2021

Link: https://dl.acm.org/doi/1..

4

List H-Coloring a Graph by Removing Few Vertices:

Chitnis, Rajesh ; Egri, László ; Marx, Dániel
Algorithmica. 78 (2016) 1 - p. 110-146 , 2016

Link: https://doi.org/10.1007/..

5

Descriptive Complexity of List H-Coloring Problems in Logsp..:

, In: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),

Dalmau, Victor ; Egri, Laszlo ; Hell, Pavol.. - p. 487-498 , 2015

Link: https://dl.acm.org/doi/1..

6

On constraint satisfaction problems below P:

Egri, László
Journal of Logic and Computation. 26 (2014) 3 - p. 893-922 , 2014

Link: https://doi.org/10.1093/..

7

Space complexity of list H-colouring : a dichotomy:

, In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms,

Egri, László ; Hell, Pavol ; Larose, Benoit. - p. 349-365 , 2014

Link: https://dl.acm.org/doi/1..

8

The Complexity of the List Homomorphism Problem for Graphs:

Egri, László ; Krokhin, Andrei ; Larose, Benoit.
Theory of Computing Systems. 51 (2011) 2 - p. 143-178 , 2011

Link: https://doi.org/10.1007/..

9

Parameterized Intractability of Even Set and Shortest Vecto..:

Bhattacharyya, Arnab ; Bonnet, Édouard ; Egri, László...
http://arxiv.org/abs/1909.01986. , 2019

Link: http://arxiv.org/abs/190..

10

Fixed-parameter Approximability of Boolean MinCSPs:

Bonnet, Edouard ; Egri, László ; Marx, Dániel
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.ESA.2016.18. , 2016

Link: https://hal.archives-ouv..

11

Fixed-parameter Approximability of Boolean MinCSPs:

Bonnet, Édouard ; Egri, László ; Lin, Bingkai.
http://arxiv.org/abs/1601.04935. , 2016

Link: http://arxiv.org/abs/160..

12

On Maltsev Digraphs:

Carvalho, Catarina ; Egri, Laszlo ; Jackson, Marcel.
Electronic Journal of Combinatorics. , 2015

Link: http://hdl.handle.net/22..

13

Space complexity of list H-coloring revisited: the case of ..:

Egri, Laszlo
http://arxiv.org/abs/1510.07124. , 2015

Link: http://arxiv.org/abs/151..

14

On Maltsev Digraphs:

Carvalho, Catarina ; Egri, Laszlo ; Jackson, Marcel.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p47/pdf. , 2015

Link: https://www.combinatoric..

15

On Constraint Satisfaction Problems below P:

Egri, Laszlo
http://arxiv.org/abs/1312.4428. , 2013

Link: http://arxiv.org/abs/131..