László Zádori Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
János Kincses, G. Makay, Miklós Maróti, József Osztényi, László Zádori: A special case of the Stahl conjecture. Eur. J. Comb. 34(2): 502-511 (2013)
2012
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Miklós Maróti, László Zádori: Reflexive digraphs with near unanimity polymorphisms. Discrete Mathematics 312(15): 2316-2328 (2012)
2010
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jaroslav Nesetril, Mark H. Siggers, László Zádori: A combinatorial constraint satisfaction problem dichotomy classification conjecture. Eur. J. Comb. 31(1): 280-296 (2010)
2009
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Benoit Larose, Matt Valeriote, László Zádori: Omitting Types, Bounded Width and the Ability to Count. IJAC 19(5): 647-668 (2009)
2007
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
László Zádori: Solvability of Systems of Polynomial Equations over Finite Algebras. IJAC 17(4): 821-835 (2007)
2006
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Benoit Larose, László Zádori: Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras. IJAC 16(3): 563-582 (2006)
2005
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Benoit Larose, Cynthia Loten, László Zádori: A polynomial-time algorithm for near-unanimity graphs. J. Algorithms 55(2): 177-191 (2005)
2003
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Benoit Larose, László Zádori: The Complexity of the Extendibility Problem for Finite Posets. SIAM J. Discrete Math. 17(1): 114-121 (2003)
2001
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Csaba Szabó, László Zádori: Idempotent Totally Symmetric Operations on Finite Posets. Order 18(1): 39-47 (2001)
1997
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Benoit Larose, László Zádori: Algebraic properties and dismantlability of finite posets. Discrete Mathematics 163(1-3): 89-99 (1997)
1989
j1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ingo Wegener, László Zádori: A Note on the Relations Between Critical and Sensitive Complexity. Elektronische Informationsverarbeitung und Kybernetik 25(8/9): 417-421 (1989)

Coauthor Index

1János Kincses
[j11]
2Benoit Larose
[j8] [j6] [j5] [j4] [j2]
3Cynthia Loten
[j5]
4G. Makay
[j11]
5Miklós Maróti (Miklos Maroti)
[j11] [j10]
6Jaroslav Nesetril (Jarik Nesetril)
[j9]
7József Osztényi
[j11]
8Mark H. Siggers
[j9]
9Csaba Szabó
[j3]
10Matthew Valeriote (Matt Valeriote)
[j8]
11Ingo Wegener
[j1]

Colors in the list of coauthors

Last update Wed May 22 08:46:37 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page