default search action
László Egri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c11]László Egri, Hamid Nabati, Jia Yuan Yu:
RainbowTag: a Fiducial Marker System with a New Color Segmentation Algorithm. ICCVE 2022: 1-6 - 2021
- [j6]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S.
, Bingkai Lin
Parameterized Intractability of Even Set and Shortest Vector Problem. J. ACM 68(3): 16:1-16:40 (2021)
2010 – 2019
- 2019
- [i9]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. CoRR abs/1909.01986 (2019) - [i8]Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c10]László Egri, Dániel Marx, Pawel Rzazewski
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. STACS 2018: 27:1-27:15 - 2017
- [j5]Rajesh Chitnis
List H-Coloring a Graph by Removing Few Vertices. Algorithmica 78(1): 110-146 (2017) - 2016
- [j4]László Egri:
On constraint satisfaction problems below P. J. Log. Comput. 26(3): 893-922 (2016) - [c9]Édouard Bonnet, László Egri, Dániel Marx:
Fixed-Parameter Approximability of Boolean MinCSPs. ESA 2016: 18:1-18:18 - [i7]Édouard Bonnet, László Egri, Dániel Marx:
Fixed-parameter Approximability of Boolean MinCSPs. CoRR abs/1601.04935 (2016) - 2015
- [j3]Catarina Carvalho
On Maltsev Digraphs. Electron. J. Comb. 22(1): 1 (2015) - [c8]Víctor Dalmau
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. LICS 2015: 487-498 - [i6]László Egri:
Space complexity of list H-coloring revisited: the case of oriented trees. CoRR abs/1510.07124 (2015) - 2014
- [c7]László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Space complexity of list H-colouring: a dichotomy. SODA 2014: 349-365 - 2013
- [c6]Rajesh Hemant Chitnis
List H-Coloring a Graph by Removing Few Vertices. ESA 2013: 313-324 - [i5]László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Space complexity of list H-colouring: a dichotomy. CoRR abs/1308.0180 (2013) - [i4]Rajesh Hemant Chitnis, László Egri, Dániel Marx:
List H-Coloring a Graph by Removing Few Vertices. CoRR abs/1308.1068 (2013) - [i3]László Egri:
On Constraint Satisfaction Problems below P. CoRR abs/1312.4428 (2013) - 2012
- [j2]László Egri, Andrei A. Krokhin
The Complexity of the List Homomorphism Problem for Graphs. Theory Comput. Syst. 51(2): 143-178 (2012) - 2011
- [c5]László Egri:
On Constraint Satisfaction Problems below P. CSL 2011: 203-217 - [c4]Catarina Carvalho
On Maltsev Digraphs. CSR 2011: 181-194 - 2010
- [c3]László Egri, Andrei A. Krokhin
The Complexity of the List Homomorphism Problem for Graphs. STACS 2010: 335-346
2000 – 2009
- 2009
- [i2]László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson:
The complexity of the list homomorphism problem for graphs. CoRR abs/0912.3802 (2009) - 2008
- [c2]László Egri, Benoît Larose, Pascal Tesson:
Directed st-Connectivity Is Not Expressible in Symmetric Datalog. ICALP (2) 2008: 172-183 - 2007
- [j1]Thomas R. Shultz, François Rivest
Could Knowledge-Based Neural Learning be Useful in Developmental Robotics? The Case of Kbcc. Int. J. Humanoid Robotics 4(2): 245-279 (2007) - [c1]László Egri, Benoît Larose, Pascal Tesson:
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. LICS 2007: 193-202 - [i1]László Egri, Benoît Larose, Pascal Tesson:
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. Electron. Colloquium Comput. Complex. TR07 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: