The following pages link to László Egri (Q527414):
Displayed 14 items.
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- (Q2260620) (redirect page) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- On constraint satisfaction problems below P (Q2826030) (← links)
- On Constraint Satisfaction Problems below P (Q2915683) (← links)
- On Maltsev Digraphs (Q3007626) (← links)
- (Q3113761) (← links)
- (Q3304125) (← links)
- Directed st-Connectivity Is Not Expressible in Symmetric Datalog (Q3519500) (← links)
- Fixed-parameter Approximability of Boolean MinCSPs (Q4606287) (← links)
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (Q4635829) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem (Q5056405) (← links)
- Space complexity of list <i>H</i>-colouring: a dichotomy (Q5383985) (← links)