\\#  new entrie are added
at the end of the file.
\#  own papers at top
\# auctex: bibtex-reformat
\# C-c C-q (= bibtex-fill-entry). 

@string{ACMTCL          ={ACM Trans. Comput. Log.}}
@string{ActaInf         ={Acta Informatica}}
@string{Alg		={Algorithmica}}
@string{AI		={Artificial Intelligence}}
@string{AIComm		={AI Communications}}
@string{AMAI		={Ann. Math. Artif. Intell.}}
@string{AMS		={American Mathematical Society}}
@string{AMM             ={Amer. Math. Monthly}}
@string{APAL		={Annals of Pure and Applied Logic}}
@string{AML             ={Archive for Mathematical Logic}}
@string{AAJC            ={Australas. J. Combin.}}
@string{BEATCS          ={Bulletin of the European Association for Theoretical
                          Computer Science}}
@string{BSL		={Bull. of Symbolic Logic}}
@string{CanJM		={Canadian J. Math.}}
@string{ComACM          ={Communications of the ACM}}
@string{Comb            ={Combinatorica}}
@string{CommMUC         ={Comment. Math. Univ. Carolinae}}
@string{ComCom		={Computational Complexity}}
@string{ComInt          ={Comput. Intelligence}},
@string{CongrNumer      ={Congr. Numer.}}
@string{Cons            ={Constraints}}
@string{DKE             ={Data Knowl. Eng.}}
@string{DAM		={Discr. Appl. Math.}}
@string{DAM-ta		={To appear in \emph{Discr. Appl. Math.}}}
@string{DAM-st		={Submitted to  \emph{Discr. Appl. Math.}}}
@string{DM		={Discrete  Math.}}
@string{DMGT            ={Discuss. Math. Graph Theory}}
@string{DukeMJ          ={Duke Math. J.}}
@string{DO              ={Discrete Optim.}}
@string{ECCC		={\emph{Electronic Colloquium on Computational 
                          Complexity} (ECCC)}}
@string{EJC            ={European J. Combin.}}
@string{ENDM            ={Electronic Notes in Discrete Mathematics}}
@string{FInf		={Fund. Inform.}}
@string{FMat		={Fund. Math.}}
@string{GC		={Graphs and Combinatorics}}
@string{IEEESE		={IEEE Transactions on Software Engineering}}
@string{IEEECAD		={IEEE Transactions on Computer Aided Design}}
@string{IC		={Information and Control}}
@string{InfComp		={Information and Computation}}
@string{InfSci		={Information Sciences}}
@string{IJAR            ={Int. J. Approx. Reason}}
@string{IJCM            ={International Journal of Computer Mathematics}}
@string{IJFCS           ={Internat. J. Found. Comput. Sci.}}
@string{IPL		={Information Processing Letters}}
@string{JAIR		={J. Artif. Intell. Res.}}
@string{JAlg		={J. Algorithms}}
@string{JAR		={Journal of Automated Reasoning}}
@string{JACM		={J. of the ACM}}
@string{JCMCC		={J. Combin. Math. Combin. Comput.}}
@string{JCombT          ={J. Combin. Theory}}
@string{JCombTB         ={J. Combin. Theory Ser. B}}
@string{JCombTA         ={J. Combin. Theory Ser. A}}
@string{JCO             ={J. Comb. Optim.}}}
@string{CPC             ={Combin. Probab. Comput.}}
@string{JComput         ={J. Comput.}}
@string{JDA             ={J. Discrete Algorithms}}
@string{JCSS            ={J. of Computer and System Sciences}}
@string{JGT             ={J. Graph Theory}}
@string{JGAA            ={J. Graph Algorithms Appl.}}
@string{JLMS            ={J. London Math. Soc.}}
@string{JLP             ={J. Logic Programming}}
@string{JLC             ={J. Logic Comput.}}
@string{JSAT            ={J on Satisfiability, Boolean Modeling and 
                          Computation}}
@string{JMLR            = {J. Mach. Learn. Res.}}
@string{JSL             ={J. Symbolic Logic}}
@string{JSC             ={J. Symbolic Comput.}}
@string{LMCS		={Logical Methods in Computer Science}}
@string{LNCS		={Lecture Notes in Computer Science}}
@string{LNAI		={Lecture Notes in Artificial Intelligence}}
@string{MFSlovensk      ={Mat.-Fyz. \v Casopis. Slovensk. Akad. Vied}}
@string{ML              ={Machine Learning}}
@string{MST             ={Math. Systems Theory}}
@string{MLQ             ={Mathematical Logic Quarterly}},
@string{NDJFL           ={Notre Dame J. Formal Logic}}
@string{NJC             ={Nordic J. Comput.}}
@string{NAMS            ={Notices Amer. Math. Soc.}}
@string{OR              ={Operations Research}}
@string{ORL             ={Oper. Res. Lett.}}
@string{SiamJC		={SIAM J. Comput.}}
@string{SiamJDM		={SIAM J. Discrete Math.}}
@string{SiamJADM        ={SIAM J. Algebraic Discrete Methods}}
@string{SiamJAM         ={SIAM J. Appl. Math.}}
@string{SigactNews	={SIGACT News}}
@string{JRStatB         ={J. R. Stat. Soc. Ser. B.}}
@string{statcomp	={Statistics and Computing}}
@string{TALG    	={ACM Transactions on Algorithms}}
@string{TCS		={Theoretical Computer Science}}
@string{TC              ={Theory of Computing}}
@string{TCJ             ={The Computer Journal}}
@string{TCSys		={Theory Comput. Syst.}}
@string{TPLP    	={Theory Pract. Log. Program.}}
@string{ZMLGM           ={Z. Math. Logik Grundlagen Math.}},



@string{AIP      	={The AAAI Press}}
@string{AcademicPress	={Academic Press}}
@string{ACM             ={Assoc. Comput. Mach., New York}}
@string{AW              ={Addison-Wesley}}
@string{CamUP		={Cambridge University Press, Cambridge}}
@string{MC              ={Morgan Kaufmann}}
@string{IEEE		={IEEE Computer Soc.}}
@string{ScienceInChinaA ={Science in China Ser. A}}
@string{SIAM            ={Society for Industrial and
                          Applied Mathematics (SIAM)}} 


@string{Springer	={Springer Verlag}}
@string{OUP             ={Oxford University Press}}
@string{Elsevier	={Elsevier Science Publishers, North-Holland}}
@string{NorthHolland	={North-Holland Publishing Co.}}
@string{Kluwer          ={Kluwer Academic Publishers, Dortrecht}}
@string{Freeman         ={W. H. Freeman and Company, New York}}
@string{Wiley           ={John Wiley \& Sons}}
@string{LZI            ={Leibniz-Zentrum fuer Informatik}}
@string{LIPIcs         ={LIPIcs}}







# 2020 ======================

@Article{GanianOrdyniak20,
  author    = {Robert Ganian and Sebastian Ordyniak},
  title       = {Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: a Survey},
  journal      = MDPIA,
  year 	       = {2020},
  note          = {to appear}
}


@inproceedings{GanianKanjOrdyniakSzeider20,
  author    = {Robert Ganian and Iyad Kanj and Sebastian Ordyniak
                  and Stefan Szeider},
  title     = {On the Parameterized Complexity of Clustering
                  Incomplete Data into Subspaces of Small Dimension},
  booktitle = {Proceeding of AAAI-20, the Thirty-Fourth AAAI
                  Conference on Artificial Intelligence, February
                  7--12, 2020, New York},
  year      = {2020},
  note     = {to appear}
}





@inproceedings{VaidyanathanSzeider2020,
    author={Peruvemba Ramaswamy, Vaidyanathan
    and Szeider, Stefan},
    editor={Simonis, Helmut},
    title="MaxSAT-Based Postprocessing for Treedepth",
    booktitle="Principles and Practice of Constraint Programming",
    year=2020,
    publisher="Springer International Publishing",
    address="Cham",
    pages="478--495",
    isbn="978-3-030-58475-7"
}


@inproceedings{SchidlerSzeider20,
  author    = {Andr\'{e} Schidler and Stefan Szeider},
  title     = {Computing Optimal Hypertree Decompositions},
  booktitle = {Proceedings of ALENEX 2020, the 22nd Workshop on
                  Algorithm Engineering and Experiments},
  year      = {2020},
  publisher = {SIAM},
  editor  = {Guy Blelloch and Irene Finocchi},
  pages = {1--11},
  pdf   = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-20-001.pdf},
}


@inproceedings{SchidlerSzeider21,
 author    = {Andr\'{e} Schidler and Stefan Szeider},
 title     = {{SAT-}based Decision Tree Learning for Large Data Sets},
 booktitle = {Proceedings of AAAI'21, the Thirty-Fifth {AAAI}
                 Conference on Artificial Intelligence},
 year      = {2021},
 publisher = {{AAAI} Press},
}



# 2019 ======================

@Article{DeHaanSzeider19,
  author    = {de Haan, Ronald and
               Stefan Szeider},
  title       = {Compendium of Parameterized Problems at Higher Levels
                  of the Polynomial Hierarchy},
  journal      = MDPIA,
  year 	       = {2019},
  pdf       =  {https://www.mdpi.com/1999-4893/12/9/188/pdf},
  doi       =  {10.3390/a12090188},
  volume    = {12},
  number    = {9},
  pages     = {1--28},
}



@InProceedings{EibenGanianKanjSzeider19,
  author       = {Eduard Eiben and Robert Ganian and Iyad Kanj and Stefan Szeider},
  title        = {The Parameterized Complexity of Cascading Portfolio Scheduling},
  booktitle = {Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems},
  year      = {2019},
  note      = {To appear}
}


@InProceedings{GanianOrdyniakSzeider19,
  author       = {Robert Ganian and Sebastian Ordyniak and Stefan Szeider},
  title        = {A Join-Based Hybrid Parameter for Constraint Satisfaction},
  booktitle = {Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming},
  year      = {2019},
  pdf          = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-19-006.pdf},
series    = LNCS,
 doi       = {10.1007/978-3-030-30048-7_12},
	publisher = Springer,
	  volume    = {11802},
	    pages     = {195--212},
	pdf =  {http://www.ac.tuwien.ac.at/files/tr/ac-tr-19-004.pdf},
  editor = {Thomas Schiex and Simon de Givry},
}





@InProceedings{GanianLodhaOrdyniakSzeider19,
  author       = {Robert Ganian and Neha Lodha and Sebastian Ordyniak
                  and Stefan Szeider},
  title        = {{SAT}-Encodings for Treecut Width and Treedepth},
  booktitle = {Proceedings of ALENEX 2019, the 21st Workshop on
                  Algorithm Engineering and Experiments},
  year      = {2019},
  editor    = {Stephen G. Kobourov and Henning Meyerhenke},
  pdf = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-19-001.pdf},
  pages     = {117--129},
  doi       = {10.1137/1.9781611975499.10},
  publisher = {SIAM},
  keywords  = {nfpc},
}
 
@Article{PaulusmaSzeider19,
  author       = {Dani\"el~Paulusma and Stefan Szeider},
  title        = {On the Parameterized Complexity of (k,s)-{SAT}},
  journal      = IPL,
  doi       = {10.1016/j.ipl.2018.11.005},
  year 	       = {2019},
  volume       = {143},
  pages =     {34--36},
   pdf    = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-18-008.pdf},
}


@inproceedings{PeitlSlivovskySzeider19b,
	author = {Tom\'{a}\v{s} Peitl and Friedrich Slivovsky and Stefan Szeider},
	title  = {Proof Complexity of Fragments of Long-Distance {Q}-resolution},
	booktitle = {Proceedings of SAT 2019,
					the 22nd International
					Conference on Theory and Applications of
					Satisfiability Testing, July
					7--12, 2019, Lisbon, Portugal},
	year      = {2019},
	editor    = {Mikol\'{a}\v{s} Janota and In\^{e}s Lynce},
	series    = LNCS,
         doi       = {10.1007/978-3-030-24258-9\_23},
	publisher = Springer,
	  volume    = {11628},
	    pages     = {319--335},
	pdf =  {http://www.ac.tuwien.ac.at/files/tr/ac-tr-19-004.pdf},
	keywords  = {QBF}
}

@inproceedings{PeitlSlivovskySzeider19a,
	author = {Tom\'{a}\v{s} Peitl and Friedrich Slivovsky and Stefan Szeider},
	title  = {Combining Resolution-Path Dependencies with Dependency Learning},
	booktitle = {Proceedings of SAT 2019,
					the 22nd International
					Conference on Theory and Applications of
					Satisfiability Testing, July
					7--12, 2019, Lisbon, Portugal},
	year      = {2019},
	editor    = {Mikol\'{a}\v{s} Janota and In\^{e}s Lynce},
	series    = LNCS,
	publisher = Springer,
	  doi       = {10.1007/978-3-030-24258-9\_22},
 pages     = {306--318},
  volume    = {11628},
     pdf  =     {http://www.ac.tuwien.ac.at/files/tr/ac-tr-19-005.pdf},
	keywords  = {QBF}
}


@Article{PeitlSlivovskySzeider19,
  author    = {Tom\'{a}\v{s} Peitl and Friedrich Slivovsky and Stefan Szeider},
  title     = {Dependency Learning for {QBF}},
  journal      = JAIR,
  doi       = {10.1613/jair.1.11529},
  year 	       = {2019},
  volume       ={65},
pages = {180--208},
url = {https://doi.org/10.1613/jair.1.11529} 
}


@Article{PeitlSlivovskySzeider18a,
  author    = {Tom\'{a}\v{s} Peitl and Friedrich Slivovsky and Stefan Szeider},
  title     = {Long-Distance {Q}-Resolution with Dependency
                  Schemes},
  journal   = JAR,
  volume    = {63},
  number    = {1},
  pages     = {127--155},
  year      = {2019},
  url       = {https://doi.org/10.1007/s10817-018-9467-3},
  doi       = {10.1007/s10817-018-9467-3},
  pdf       = {https://doi.org/10.1007/s10817-018-9467-3},
  keywords  = {QBF},
}




# 2018 ======================

 



@InProceedings{GanianKimSlivovskySzeider18,
  author       = {Robert Ganian and Eun Jung Kim and Friedrich
                  Slivovsky and Stefan Szeider},
  title        = {Sum-of-Products with Default Values: Algorithms and Complexity Results},
  booktitle = {Proceedings of {ICTAI} 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence},
year      = {2018},
   url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-18-007.pdf},
  doi       = {10.1109/ICTAI.2018.00115},
  pages     = {733--737},
  editor    = {Lefteri H. Tsoukalas and
               {\'{E}}ric Gr{\'{e}}goire and
               Miltiadis Alamaniotis},
  publisher = {{IEEE}},
  keywords  = {QBF}
}


@InProceedings{HoosPeitlSlivovskySzeider18,
  author       = {Holger H. Hoos and Tom\'{a}\v{s} Peitl and Friedrich
                  Slivovsky and Stefan Szeider},
  title        = {Portfolio-Based Algorithm Selection for Circuit {QBFs}},
  booktitle = {Proceedings of CP 2018, the 24rd International
                  Conference on Principles and Practice of Constraint
                  Programming},
  pages     = {195--209},
  year      = {2018},
  series    = LNCS,
  editor    = {John N. Hooker},
  volume    = {11008},
  publisher = Springer,
  doi       = {10.1007/978-3-319-98334-9_13},
  pdf       = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-18-004.pdf},
  keywords  = {QBF}
}


@InProceedings{FichteHecherLodhaSzeider18,
  author       = {Johannes K. Fichte and Markus Hecher and Neha Lodha
                  and Stefan Szeider},
  title        = {An {SMT} Approach to Fractional Hypertree Width},
  booktitle = {Proceedings of CP 2018, the 24rd International
                  Conference on Principles and Practice of Constraint
                  Programming},
  year      = {2018},
  series    = LNCS,
  editor    = {John N. Hooker},
  pages     = {109--127},
  doi       = {10.1007/978-3-319-98334-9_8},
  publisher = Springer,
  volume    = {11008},
  pdf       = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-18-006.pdf},
  keywords   ={fraSMT},
}

@InProceedings{HoosPeitlSlivovskySzeider18a,
  author	= "Hoos, Holger H. and Peitl, Tom{\'a}{\v{s}} and Slivovsky, Friedrich and Szeider, Stefan",
  title		= "Portfolio-Based Algorithm Selection for Circuit {QBF}s",
  booktitle	= "QBF Workshop",
  year		= "2018"
}


@Misc{HoosPeitlSlivovskySzeider18b,
  author	= {Hoos, Holger H. and Peitl, Tom{\'a}{\v{s}} and
                  Slivovsky, Friedrich and Szeider, Stefan},
  title		= {Portfolio Solvers for {QDIMACS} and {QCIR}},
  year      = {2018},
  note      = {QBF Evaluation at SAT},
}

@InProceedings{PeitlSlivovskySzeider18,
  author    = {Tom\'{a}\v{s} Peitl and Friedrich Slivovsky and Stefan Szeider},
  title     = {Polynomial-Time Validation of {QCDCL} Certificates},
  booktitle = {Proceedings of SAT 2018,
                  the 21st International
                  Conference on Theory and Applications of
                  Satisfiability Testing, Part of FLoC 2018, July
                  9--12, 2018, Oxford, UK},
  year      = {2018},
  editor    = {Olaf Beyersdorff and Christoph M. Wintersteiger},
  series    = LNCS,
  publisher = Springer,
  pages     = {253--269},
  volume    = {10929},
  url       = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-18-003.pdf},
  doi       = {10.1007/978-3-319-94144-8},
  keywords  = {QBF}
}


@InProceedings{GanianKanjOrdyniakSzeider18,
  author    = {Robert Ganian and Iyad Kanj and Sebastian Ordyniak
                  and Stefan Szeider},
  title     = {Parameterized Algorithms for the Matrix Completion Problem},
  booktitle = {Proceeding of ICML, the Thirty-fifth International
                  Conference on Machine Learning, Stockholm, July
                  10--15, 2018},
  year      = {2018},
  pages     = {1642--1651},
  publisher = {JMLR.org},
  note      = {ISSN: 1938-7228},
  pdf       = {https://arxiv.org/pdf/1804.03423}
}

@Article{EibenGanianSzeider18,
  author       = {Eduard Eiben and Robert Ganian and Stefan Szeider},
  title        = {Solving Problems on Graphs of High Rank-Width},
  journal      = Alg,
  volume    = {80},
  number    = {2},
  pages     = {742--771},
  year      = {2018},
  url       = {https://doi.org/10.1007/s00453-017-0290-8},
  doi       = {10.1007/s00453-017-0290-8},
  keywords  = {xtract} 
}



@inproceedings{EibenGanianOrdyniak18,
  author    = {Eduard Eiben and 
               Robert Ganian and
               Sebastian Ordyniak},
  editor    = {Rolf Neidermeier and 
               Brigitte Vall{\' e}e},
  title     = {Small Resolution Proofs for {QBF} using Dependency Treewidth},
  booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS} 2018, February 28--March 3, 2018, Caen, France},
  series    = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  keywords  = {xtract},
  volume    = {96},
  pages     = {28:1--28:15},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2018/8513/}
}


@article{EibenGanianSzeider18a,
  author    = {Eduard Eiben and
               Robert Ganian and
               Stefan Szeider},
  title     = {Meta-kernelization using well-structured modulators},
  journal   = DAM,
  year      = {2018},
  keywords  = {xtract},
  volume    = {248},
  pages = {153--167},
  doi    = {10.1016/j.dam.2017.09.018},
  url       = {https://arxiv.org/abs/1507.05544},
}  



# 2017 ======================




@article {HaanKanjSzeider17,
    author = {de Haan, Ronald and Kanj, Iyad and Szeider, Stefan},
     title = {On the parameterized complexity of finding small unsatisfiable
              subsets of {CNF} formulas and {CSP} instances},
   journal = ACMTCL,
    volume = {18},
      year = {2017},
    number = {3},
     pages = {Art. 21, 46},
      issn = {1529-3785},
       doi       = {10.1145/3091528},
     pdf = {https://doi.org/10.1145/3091528},
keywords={xtract},
}


    
    
    



@inproceedings{LodhaOrdyniakSzeider17b,
  author    = {Neha Lodha and
               Sebastian Ordyniak and
               Stefan Szeider},
  title     = {A {SAT} Approach to Branchwidth},
  booktitle = {Proceedings of the Twenty-Sixth International Joint Conference on
               Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August
               19-25, 2017},
  pages     = {4894--4898},
  year      = {2017},
  doi       = {10.24963/ijcai.2017/689},
  editor    = {Carles Sierra},
  publisher = {ijcai.org},
  year      = {2017},
  url       = {https://www.ijcai.org/proceedings/2017/0689.pdf},
  note      = {Sister Conference Best Paper Track},
    keywords={branchwidth,local-improvement},
}







@article {MuellerSzeider17,
  author    = {Moritz M{\"{u}}ller and Stefan Szeider},
     title = {The Treewidth of Proofs},
   journal = InfComp,
 volume    = {255},
  pages     = {147--164},
  year      = {2017},
  pdf       = {https://www.ac.tuwien.ac.at/files/tr/ac-tr-17-010.pdf},
  doi       = {10.1016/j.ic.2017.05.005},
}


@inproceedings{GanianRamanujanSzeider17b,
  author    = {Robert Ganian and M. S. Ramanujan and Stefan Szeider},
  title     = {Backdoor Treewidth for {SAT}},
   booktitle = {Theory and Applications of Satisfiability Testing -
                  {SAT} 2017 - 20th International Conference,
                  Melbourne, VIC, Australia, August 28 - September 1,
                  2017, Proceedings},
  pages     = {20--37},
   editor    = {Serge Gaspers and
               Toby Walsh},
  series    = LNCS,
  volume    = {10491},
  publisher = Springer,
  year      = {2017},
  doi       = {10.1007/978-3-319-66263-3_2},
  pdf       = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-014.pdf},
  keywords={xtract},
}



@inproceedings{PeitlSlivovskySzeider17,
author    = {Tom\'{a}\v{s} Peitl and Friedrich Slivovsky and Stefan Szeider},
  title     = {Dependency learning for {QBF}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT}
                  2017 - 20th International Conference, Melbourne,
                  VIC, Australia, August 28 - September 1, 2017,
                  Proceedings},
  pages     = {298--313},
  year      = {2017},
  url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-011.pdf},
  doi       = {10.1007/978-3-319-66263-3_19},
  editor    = {Serge Gaspers and
               Toby Walsh},
  series    = LNCS,
  volume    = {10491},
  publisher = Springer,
  keywords  = {QBF,dependency},
}



@inproceedings{GanianSzeider17,
  author    = {Robert Ganian and Stefan Szeider},
  title     = {New Width Parameters for Model Counting},
 booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th
               International Conference, Melbourne, VIC, Australia, August 28 - September
               1, 2017, Proceedings},
  pages     = {38--52},
  year      = {2017},
   doi       = {10.1007/978-3-319-66263-3_3},
 pdf = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-013.pdf},
   editor    = {Serge Gaspers and
               Toby Walsh},
   series    = LNCS,
  volume    = {10491},
  publisher = Springer,
   keywords={xtract},
}






@inproceedings{LodhaOrdyniakSzeider17,
  author    = {Neha Lodha and Sebastian Ordyniak and Stefan Szeider},
  title     = {{SAT}-Encodings for Special Treewidth and Pathwidth},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th
               International Conference, Melbourne, VIC, Australia, August 28 - September
               1, 2017, Proceedings},
  pages     = {429--445},
  year      = {2017},
   doi       = {10.1007/978-3-319-66263-3_27},
   url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-012.pdf},
   editor    = {Serge Gaspers and
               Toby Walsh},
  volume    = {10491},
  series    = LNCS,
  publisher = Springer,
     keywords={compile},
}






@inproceedings{FichteLodhaSzeider17,
  author    = {Johannes K. Fichte and Neha Lodha and Stefan Szeider},
  title     = {{SAT}-Based Local Improvement for Finding Tree
                  Decompositions of Small Width},
  booktitle = {Theory and Applications of Satisfiability Testing -
                  {SAT} 2017 - 20th International Conference,
                  Melbourne, VIC, Australia, August 28 - September 1,
                  2017, Proceedings},
  pages     = {401--411},
  year      = {2017},
   doi       = {10.1007/978-3-319-66263-3_25},
  pdf ={http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-015.pdf},
   editor    = {Serge Gaspers and
               Toby Walsh},
   series    = LNCS,
  volume    = {10491},
  publisher = Springer,
   keywords={xtract},
}



@inproceedings{FichteSzeider17,
  author    = {Johannes Klaus Fichte and
               Stefan Szeider},
  title     = {Backdoor Trees for Answer Set Programming},
  booktitle = {Proceedings of the 10th Workshop on Answer Set
                  Programming and Other Computing Paradigms co-located
                  with the 14th International Conference on Logic
                  Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR
                  2017, Espoo, Finland, July 3, 2017.},
  editor    = {Bart Bogaerts and
               Amelia Harrison},
  series    = {{CEUR} Workshop Proceedings},
  volume    = {1868},
  publisher = {CEUR-WS.org},
  year      = {2017},
  url       = {http://ceur-ws.org/Vol-1868},
}






@inproceedings{BovaSzeider17,
  author    = {Simone Bova and Stefan Szeider},
  title     = {Circuit Treewidth, Sentential Decision, and Query  Compilation},
  year      = {2017},
  pages     = {233--246},
  editor    = {Emanuel Sallinger and Jan Van den Bussche and Floris
                  Geerts},
  booktitle     = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI}
                  Symposium on Principles of Database Systems, {PODS}
                  2017, Chicago, IL, USA, May 14-19, 2017},
  publisher = {ACM},
 url       = {https://arxiv.org/abs/1701.04626},
 doi       = {10.1145/3034786.3034787},
 }


@incollection{GaspersOrdyniakSzeider17,
  author    = {Serge Gaspers and
               Sebastian Ordyniak and
               Stefan Szeider},
  title     = {Backdoor Sets for {CSP}},
  booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
  pages     = {137--157},
  year      = {2017},
  editor    = {Andrei A. Krokhin and
               Stanislav Zivny},
  series    = {Dagstuhl Follow-Ups},
  volume    = {7},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-003-3},
  doi =	     {10.4230/DFU.Vol7.15301.137},
}



@article{GanianRamanujanSzeider17a,
  author    = {Robert Ganian and
               M. S. Ramanujan and
               Stefan Szeider},
  title     = {Discovering Archipelagos of Tractability for Constraint
                  Satisfaction and Counting},
  journal   = TALG,
  year      = {2017},
  volume  = {13},
  number  ={2},
  pages  ={29:1--29:32},
  pdf = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-016.pdf},
  doi = {10.1145/3014587},
  keywords  = {xtract},
}


@inproceedings{DeHaan17,
  title={Complexity Results for Manipulation, Bribery and Control of
                  the {K}emeny Judgment Aggregation Procedure},
  author={Ronald de Haan},
  booktitle={Proceedings of {AAMAS} 2017, the 16th International
                  Conference on Autonomous Agents and Multiagent
                  Systems},
  year={2017},
  publisher = {{IFAAMAS/ACM}},
}


@article{DeHaanSzeider17,
  
author = 	 {Ronald de Haan and Stefan Szeider},
  title = 	 {Parameterized Complexity Classes Beyond {Para-NP}},
  journal   = JCSS,
year = 	 {2017},
   volume    = {87},
  pages     = {16--57},
   doi       = {10.1016/j.jcss.2017.02.002},
  pdf ={https://doi.org/10.1016/j.jcss.2017.02.002},
 }



 

@article{GaspersMisraOrdyniakSzeiderZivny17,
  author    = {Serge Gaspers and
               Neeldhara Misra and
               Sebastian Ordyniak and
               Stefan Szeider and
               Stanislav Zivny},
  title     = {Backdoors into heterogeneous classes of {SAT} and {CSP}},
  journal   = JCSS,
  volume    = {85},
  pages     = {38--56},
  year      = {2017},
  url       = {http://dx.doi.org/10.1016/j.jcss.2016.10.007},
  doi       = {10.1016/j.jcss.2016.10.007},
}



@InProceedings{GanianRamanujanSzeider17,
  author ={Robert Ganian and M. S. Ramanujan and Stefan Szeider},
  title ={{Combining Treewidth and Backdoors for CSP}},
  booktitle ={34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
  pages ={36:1--36:17},
  series ={Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN ={978-3-95977-028-6},
  ISSN ={1868-8969},
  year ={2017},
  volume ={66},
  editor ={Heribert Vollmer and Brigitte Vallée},
  publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address ={Dagstuhl, Germany},
  URL ={http://drops.dagstuhl.de/opus/volltexte/2017/6998},
  URN ={urn:nbn:de:0030-drops-69986},
  doi ={10.4230/LIPIcs.STACS.2017.36},
  annote ={Keywords: Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction},
  keywords={xtract}
}
  
@inproceedings{RamanujanSzeider17,
  author    = {M. S. Ramanujan and
               Stefan Szeider},
  title     = {Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable},
  booktitle = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,
               February 4-9, 2017, San Francisco, California, {USA}},
  pages     = {3929--3935},
  year      = {2017},
  url       = {http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14706},
  keywords = {xtract}
  }
  
  


# 2016 ======================



@inproceedings{DeHaanSzeider16,
  author = {Ronald de Haan and Stefan Szeider},
  title = {Parameterized Complexity Results for
                  Symbolic Model Checking of Temporal Logics},
  booktitle = {Proceedings of KR 2016, the Fifteenth
                  International Conference on Principles
                  of Knowledge Representation and
                  Reasoning, Cape Town, South Africa,
                  April 25-29, 2016},
  publisher = {AAAI Press},
  year = {2016},
  pages     = {453--462},
  editor    = {Chitta Baral and James P. Delgrande and Frank Wolter},
  url = {https://www.ac.tuwien.ac.at/files/tr/ac-tr-15-002.pdf},
}



@InProceedings{LodhaOrdyniakSzeider16,
  author       = {Neha Lodha and Sebastian Ordyniak and Stefan Szeider},
  title        = {A {SAT} Approach to Branchwidth},
   booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
               International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
  pages     = {179--195},
  year      = {2016},
   doi       = {10.1007/978-3-319-40970-2_12},
   editor    = {Nadia Creignou and
               Daniel Le Berre},
   series    = LNCS,
  volume    = {9710},
  publisher = Springer,
      keywords={branchwidth,local-improvement},
}


@InProceedings{PeitlSlivovskySzeider16,
  author       = {Tom\'{a}\v{s} Peitl and Friedrich Slivovsky and Stefan Szeider},
  title        = {Long Distance {Q}-Resolution with Dependency Schemes},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
               International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
  pages     = {500--518},
  year      = {2016},
  url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-003.pdf},
  editor    = {Nadia Creignou and
               Daniel Le Berre},
  series    = LNCS,
  volume    = {9710},
  publisher = Springer,
  doi = {10.1007/978-3-319-40970-2_31},
  keywords = {QBF}
}



@TechReport{BovaDeHaanLodhaSzeider16,
  author    = {Simone Bova and Ronald de Haan and Neha Lodha and Stefan Szeider},
  title       = {Positive and Negative Results for Parameterized Compilability},
  institution  = {Algorithms and Complexity Group, TU Wien},
  year 	       = {2016},
  number    = {AC-TR-16-003},
  url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-16-003.pdf},
}



@inproceedings{GanianRamanujanSzeider16c,
  author    = {Robert Ganian and Ramanujan M.S. and Stefan Szeider},
  year      = {2016},
  title     = {Backdoors to Tractable Valued {CSP}},
  booktitle = {Principles and Practice of Constraint Programming -
                  22nd International Conference, {CP} 2016, Toulouse,
                  France, September 5-9, 2016, Proceedings},
  pages     = {233--250},
 editor    = {Michel Rueher},
 series    = LNCS,
  volume    = {9892},
  publisher = Springer,
  keywords   = {xtract},
  doi =      {10.1007/978-3-319-44953-1 16},
  url       = {http://arxiv.org/abs/1612.05733}
}


@inproceedings{GanianDeHaanKanjSzeider16,
  author    = {Robert Ganian and Ronald de Haan and Iyad Kanj and Stefan Szeider},
  title =	{{On Existential MSO and its Relation to ETH}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{42:1--42:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  doi =		{10.4230/LIPIcs.MFCS.2016.42},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6455},
  keywords   = {xtract}
}






@article{BovaGanianSzeider16b,
  author    = {Simone Bova and Robert Ganian and Stefan Szeider},
  title     = {Quantified Conjunctive Queries on Partially Ordered Sets},
  journal   = TCS,
 volume    = {618},
  pages     = {72--84},
  year      = {2016},
  url       = {http://arxiv.org/abs/1408.4263},
 doi         = {10.1016/j.tcs.2016.01.010},
  keywords  = {xtract}
}




@article{GaspersOrdyniakRamanujanSaurabhSzeider16,
  author       = {Serge Gaspers and Sebastian Ordyniak and
                  M. S. Ramanujan and Saket Saurabh and Stefan
                  Szeider},
   title     = {Backdoors to q-{Horn}},
  journal   = Alg,
  volume    = {74},
  number    = {1},
  pages     = {540--557},
  year      = {2016},
  url       = {http://dx.doi.org/10.1007/s00453-014-9958-5},
  doi       = {10.1007/s00453-014-9958-5},
  keywords={xtract}
}



@article {SlivovskySzeider16a,
    author = {Slivovsky, Friedrich and Szeider, Stefan},
     title = {Quantifier reordering for {QBF}},
   journal = JAR,
    volume = {56},
      year = {2016},
    number = {4},
     pages = {459--477},
       doi = {10.1007/s10817-015-9353-1},
       url = {http://dx.doi.org/10.1007/s10817-015-9353-1},
}

@article{SlivovskySzeider16,
  author    = {Friedrich Slivovsky and
               Stefan Szeider},
  title     = {Soundness of {Q-resolution} with dependency schemes},
  journal   = TCS,
  volume    = {612},
  pages     = {83--101},
  year      = {2016},
  url       = {http://dx.doi.org/10.1016/j.tcs.2015.10.020},
  doi       = {10.1016/j.tcs.2015.10.020},
}


@inproceedings{GanianKalanySzeiderTraff16,
  author    = {Robert Ganian and
               Martin Kalany and
               Stefan Szeider and
               Jesper Larsson Tr\"{a}ff},
  title     = {Polynomial-Time Construction of Optimal {MPI} Derived
                  Datatype Trees},
  booktitle = {2016 {IEEE} International Parallel and Distributed
                  Processing Symposium, {IPDPS} 2016, Chicago, IL,
                  USA, May 23-27, 2016},
  pages     = {638--647},
  year      = {2016},
  doi       = {10.1109/IPDPS.2016.13},
  url       = {https://arxiv.org/abs/1506.09100},
  publisher = {{IEEE} Computer Society},
  keywords  = {xtract}
}


@inproceedings{GanianRamanujanSzeider16,
  author    = {Robert Ganian and M. S. Ramanujan and Stefan Szeider},
  title     = {Discovering Archipelagos of Tractability for Constraint
                  Satisfaction and Counting},
   booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages     = {1670--1681},
  year      = {2016},
   doi      = {10.1145/3014587},
  url       = {https://arxiv.org/abs/1507.02479},
  keywords  = {xtract}
}

@article{GanianSlivovskySzeider16,
    author = {Robert Ganian and Friedrich Slivovsky and Stefan Szeider},
     title = {Meta-Kernelization with Structural Parameters},
   journal = JCSS,
      year = {2016},
     volume = {82},
     number = {2},
     pages = {333--346},
     url   = {https://arxiv.org/abs/1303.1786},
    doi   = {10.1016/j.jcss.2015.08.003},
    keywords  = {xtract}   
}


@article{BovaGanianSzeider16,
    author = {Simone Bova and Robert Ganian and Stefan Szeider},
     title = {Model Checking Existential Logic on Partially Ordered Sets},
   journal = ACMTCL,
      year = {2016},
      number = {2},
      volume = {17},
      keywords = {compile},
      doi = {10.1145/2814937},
}



@Article{PaulusmaSlivovskySzeider16,
  author       = {Dani{\"e}l Paulusma and Friedrich Slivovsky and
                  Stefan Szeider},
  title	       = {Model Counting for {CNF} Formulas of Bounded Modular
                  Treewidth},
  journal      = Alg,
  volume    = {76},
  number    = {1},
  pages     = {168--194},
  year      = {2016},
  url       = {http://dx.doi.org/10.1007/s00453-015-0030-x},
  doi       = {10.1007/s00453-015-0030-x},
}



# 2015 ======================




@article{KanjSzeider15,
  author    = {Iyad A. Kanj and
               Stefan Szeider},
  title     = {Parameterized and subexponential-time complexity of
                  satisfiability problems and applications},
  journal   = TCS,
  volume    = {607},
  pages     = {282--295},
  year      = {2015},
  url       = {http://dx.doi.org/10.1016/j.tcs.2015.08.029},
  doi       = {10.1016/j.tcs.2015.08.029},
}




@article{FichteSzeider15b,
  author = {Johannes Klaus Fichte and Stefan Szeider},
  title = {Backdoors to Normality for Disjunctive Logic Programs},
   journal = ACMTCL,
   year = {2015},
   number = {1},
   volume = {17},
    doi = {10.1145/2818646},
}






@inproceedings{GanianKimSzeider15,
  author    = {Robert Ganian and Eun Jung Kim and Stefan Szeider},
  title     = {Algorithmic Applications of Tree-Cut Width},
  booktitle = {Mathematical Foundations of Computer Science 2015 -
                  40th International Symposium, {MFCS} 2015, Milan,
                  Italy, August 24-28, 2015, Proceedings, Part {II}},
  pages     = {348--360},
  year      = {2015},
  url       = {https://www.ac.tuwien.ac.at/files/tr/ac-tr-15-005.pdf},
  doi       = {10.1007/978-3-662-48054-0_29},
  series    = LNCS,
  volume    = {9235},
  publisher = Springer,
  keywords  = {xtract}               

}

@article{HeuleSzeider15,
  author    = {Marijn Heule and
               Stefan Szeider},
  title     = {A {SAT} Approach to Clique-Width},
  journal   = ACMTCL,
  volume    = {16},
  number    = {3},
  pages     = {24},
  year      = {2015},
  url       = {http://doi.acm.org/10.1145/2736696},
  doi       = {10.1145/2736696},
}


@article{GaspersKoivistoLiedloffOrdyniakSzeider15,
  author    = {Serge Gaspers and
               Mikko Koivisto and
               Mathieu Liedloff and
               Sebastian Ordyniak and
               Stefan Szeider},
  title     = {On finding optimal polytrees},
  journal   = TCS,
  volume    = {592},
  pages     = {49--58},
  year      = {2015},
  url       = {http://dx.doi.org/10.1016/j.tcs.2015.05.012},
  doi       = {10.1016/j.tcs.2015.05.012},
}



@InProceedings{GanianSzeider15,
  author       = {Robert Ganian and Stefan Szeider},
  title        = {Community Structure Inspired Algorithms for {SAT} and \#{SAT}},
  booktitle = {18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas},
  year      = {2015},
  editor    = {Marijn Heule and Sean Weaver},
  series    = LNCS,
  publisher = Springer,
  number    = {9340},
  pages     = {223-237},
  doi       = {10.1007/978-3-319-24318-4_17},
  url       = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-15-001.pdf},
  keywords  = {xtract}               
}

@InProceedings{EibenGanianSzeider15b,
  author       = {Eduard Eiben and Robert Ganian and Stefan Szeider},
  title        = {Meta-Kernelization using Well-Structured Modulators},
  booktitle = {Parameterized and Exact Computation - 10th International Symposium, {IPEC} 2014, Patras, Greece, September 16-18, 2015. Revised Selected
               Papers},
  year      = {2015},
  pages     = {114--126},
 editor    = {Thore Husfeldt and
               Iyad A. Kanj},
  series    = {LIPIcs},
  volume    = {43},
  doi       = {10.4230/LIPIcs.IPEC.2015.114},
  url = {http://drops.dagstuhl.de/opus/volltexte/2015/5576/pdf/13.pdf},
  keywords  = {xtract},
}

@InProceedings{EibenGanianSzeider15,
  author       = {Eduard Eiben and Robert Ganian and Stefan Szeider},
  title        = {Solving Problems on Graphs of High Rank-Width},
  booktitle = {Algorithms and Data Structures Symposium (WADS 2015),
August 5-7, 2015,  University of Victoria, BC, Canada},
  year      = {2015},
  pages     = {314--326},
  series    = {LNCS},
  publisher = Springer,
  doi       = {10.1007/978-3-319-21840-3_26},
  url = {http://arxiv.org/abs/1507.05463},
  keywords  = {xtract},
}

@article {BackstromJonssonOrdyniakSzeider15,
    author = {B{\"a}ckstr{\"o}m, Christer and Jonsson, Peter and Ordyniak,
              Sebastian and Szeider, Stefan},
     title = {A complete parameterized complexity analysis of bounded
              planning},
   journal = JCSS,
    volume = {81},
      year = {2015},
    number = {7},
     pages = {1311--1332},
       doi = {10.1016/j.jcss.2015.04.002},
       url = {http://dx.doi.org/10.1016/j.jcss.2015.04.002},
}



@article{FichteSzeider15,
  author    = {Johannes Klaus Fichte and
               Stefan Szeider},
  title     = {Backdoors to Tractable Answer Set Programming},
  journal   = AI,
  volume    = {220},
  pages     = {64--103},
  year      = {2015},
  month     = mar,
  doi       = {10.1016/j.artint.2014.12.001},
}



@inproceedings{EndrissDeHaanSzeider15,
  title={Parameterized Complexity Results for Agenda Safety in
                  Judgment Aggregation},
  author={Ulle Endriss and Ronald de Haan and Stefan Szeider},
  booktitle={Proceedings of {AAMAS} 2015, the 14th International
                  Conference on Autonomous Agents and Multiagent
                  Systems},
  year={2015},
   pages     = {127--136},
 editor    = {Gerhard Weiss and
               Pinar Yolum and
               Rafael H. Bordini and
               Edith Elkind},  
  publisher = {{IFAAMAS/ACM}},
  url = {https://www.ac.tuwien.ac.at/files/tr/ac-tr-16-005.pdf},
}


@Article{DeHaanKanjSzeider15,
  author    = {Ronald de Haan and Iyad A. Kanj and Stefan Szeider},
  title = 	 {On the Subexponential-Time Complexity of {CSP}},
  journal = 	 JAIR,
  year = 	 {2015},
  volume = 	 {52},
  pages = 	 {203--234},
  url = {http://jair.org/media/4540/live-4540-8441-jair.pdf},
  doi = {10.1613/jair.4540},
}

@inproceedings{DeHaanSzeider15,
  author    = {Ronald de Haan and
               Stefan Szeider},
  title     = {Machine Characterizations for Parameterized Complexity
                  Classes Beyond {Para-NP}},
  booktitle = {{SOFSEM} 2015: Theory and Practice of Computer Science
                  - 41st International Conference on Current Trends in
                  Theory and Practice of Computer Science, Pec pod
                  Sn{\v{e}}{\v{z}}kou, Czech Republic, January 24-29,
                  2015.  Proceedings},
  pages     = {217--229},
  year      = {2015},
  month     = jan,
  doi       = {10.1007/978-3-662-46078-8_18},
  series    = LNCS,
  volume    = {8939},
  publisher = Springer,
  url = {https://www.ac.tuwien.ac.at/files/tr/ac-tr-15-009.pdf},
}




# 2014 ======================

@inproceedings{GaspersMisraOrdyniakSzeiderZivny14,
  author    = {Serge Gaspers and
               Neeldhara Misra and
               Sebastian Ordyniak and
               Stefan Szeider and
               Stanislav Zivny},
  Title     = {Backdoors into Heterogeneous Classes of {SAT} and {CSP}},
  booktitle = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,
               July 27 -31, 2014, Qu{\'{e}}bec City, Qu{\'{e}}bec, Canada.},
  year      = {2014},
  pages     = {2652--2658},
  editor    = {Carla E. Brodley and
               Peter Stone},
  publisher = {{AAAI} Press},
}


@article {GaspersSzeider14,
    author = {Gaspers, Serge and Szeider, Stefan},
     title = {Guarantees and limits of preprocessing in constraint
              satisfaction and reasoning},
   journal = {AI},
    volume = {216},
      year = {2014},
     pages = {1--19},
}


# 2013 ======================





@InProceedings{PfandlerRummeleSzeider13,
  author       = {Andreas Pfandler and Stefan R\"{u}mmele and Stefan
                  Szeider},
  title	       = {Backdoors to Abduction},
  booktitle    = {Proceedings of IJCAI 2013, the 23th International
                  Joint Conference on Artificial Intelligence, August
                  3--9, 2013, Beijing, China},
  year	       = 2013,
}

@article{OrdyniakSzeider13,
  author       = {Sebastian Ordyniak and Stefan Szeider},
  title	       = {Parameterized Complexity Results for Exact {B}ayesian
                  Network Structure Learning},
  journal      = JAIR,
  volume       = {46},
  year	       = {2013},
  pages	       = {263--302},
}


@article{OrdyniakPaulusmaSzeider13,
  author       = {Sebastian Ordyniak and Dani{\"e}l Paulusma and
                  Stefan Szeider},
  title	       = {Satisfiability of acyclic and almost acyclic {CNF}
                  formulas},
  journal      = TCS,
  volume       = {481},
  year	       = {2013},
  pages	       = {85--99},
}


@inproceedings{BackstromJonssonOrdyniakSzeider13,
  author       = {Christer B{\"a}ckstr{\"o}m and Peter Jonsson and
                  Sebastian Ordyniak and Stefan Szeider},
  title	       = {Parameterized Complexity and Kernel Bounds for Hard
                  Planning Problems},
  pages	       = {13--24},
  editor       = {Paul G. Spirakis and Maria J. Serna},
  booktitle    = {Algorithms and Complexity, 8th International
                  Conference, CIAC 2013, Barcelona, Spain, May 22-24,
                  2013. Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7878},
  year	       = {2013},
}


@inproceedings{GaspersOrdyniakRamanujanSaurabhSzeider13,
  author       = {Serge Gaspers and Sebastian Ordyniak and
                  M. S. Ramanujan and Saket Saurabh and Stefan
                  Szeider},
  title	       = {Backdoors to q-Horn},
  pages	       = {67--79},
  editor       = {Natacha Portier and Thomas Wilke},
  booktitle    = {30th International Symposium on Theoretical Aspects
                  of Computer Science, STACS 2013, February 27 - March
                  2, 2013, Kiel, Germany},
  publisher    = LZI,
  series       = LIPIcs,
  volume       = {20},
  year	       = {2013},
}

@inproceedings{HeuleSzeider13,
  author       = {Marijn Heule and Stefan Szeider},
  title	       = {A {SAT} Approach to Clique-Width},
  pages	       = {318--334},
  editor       = {Matti J{\"a}rvisalo and Allen Van Gelder},
  booktitle    = {Theory and Applications of Satisfiability Testing -
                  SAT 2013 - 16th International Conference, Helsinki,
                  Finland, July 8-12, 2013. Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7962},
  year	       = {2013},
}


@inproceedings{HaanKanjSzeider13,
  author       = {Ronald de Haan and Iyad A. Kanj and Stefan Szeider},
  title	       = {Local Backbones},
  pages	       = {377--393},
  editor       = {Matti J{\"a}rvisalo and Allen Van Gelder},
  booktitle    = {Theory and Applications of Satisfiability Testing -
                  SAT 2013 - 16th International Conference, Helsinki,
                  Finland, July 8-12, 2013. Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7962},
  year	       = {2013},
}


@inproceedings{MisraOrdyniakRamanSzeider13,
  author       = {Neeldhara Misra and Sebastian Ordyniak and Venkatesh
                  Raman and Stefan Szeider},
  title	       = {Upper and Lower Bounds for Weak Backdoor Set
                  Detection},
  pages	       = {394--402},
  editor       = {Matti J{\"a}rvisalo and Allen Van Gelder},
  booktitle    = {Theory and Applications of Satisfiability Testing -
                  SAT 2013 - 16th International Conference, Helsinki,
                  Finland, July 8-12, 2013. Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7962},
  year	       = {2013},
}

@inproceedings{PaulusmaSlivovskySzeider13,
  author       = {Dani{\"e}l Paulusma and Friedrich Slivovsky and
                  Stefan Szeider},
  title	       = {Model Counting for CNF Formulas of Bounded Modular
                  Treewidth},
  pages	       = {55--66},
  editor       = {Natacha Portier and Thomas Wilke},
  booktitle    = {30th International Symposium on Theoretical Aspects
                  of Computer Science, STACS 2013, February 27 - March
                  2, 2013, Kiel, Germany},
  publisher    = LZI,
  series       = LIPIcs,
  volume       = {20},
  year	       = {2013},
}

@InProceedings{HaanRoubickovaSzeider13,
  author       = {Ronald de Haan and Anna Roubickova and Stefan
                  Szeider},
  title	       = {Parameterized Complexity Results for Plan Reuse},
  booktitle    = {Proceedings of AAAI 2013, the 27th AAAI Conference
                  on Artificial Intelligence, July 14-18, 2013,
                  Bellevue, Washington, USA},
  pages	       = {224--231},
  year	       = {2013},
  editor       = {Marie des Jardins and Michael L. Littman},
  publisher    = AIP,
}


@InProceedings{FichteSzeider13,
  author       = {Johannes Klaus Fichte and Stefan Szeider},
  title	       = {Backdoors to Normality for Disjunctive Logic
                  Programs},
  booktitle    = {Proceedings of AAAI 2013, the 27th AAAI Conference
                  on Artificial Intelligence, July 14-18, 2013,
                  Bellevue, Washington, USA},
  pages	       = {320-337},
  year	       = {2013},
  editor       = {Marie des Jardins and Michael L. Littman},
  publisher    = AIP,
}


@InProceedings{KanjSzeider13,
  author       = {Iyad Kanj and Stefan Szeider},
  title	       = {On the Subexponential Time Complexity of {CSP}},
  pages	       = {459--465},
  booktitle    = {Proceedings of AAAI 2013, the 27th AAAI Conference
                  on Artificial Intelligence, July 14-18, 2013,
                  Bellevue, Washington, USA},
  year	       = {2013},
  editor       = {Marie des Jardins and Michael L. Littman},
  publisher    = AIP,
}



# 2012 ======================



@article {vantHofKaminskiPaulusmaSzeiderThilikos12,
  author       = {van 't Hof, Pim and Kami{\'n}ski, Marcin and
                  Paulusma, Dani{\"e}l and Szeider, Stefan and
                  Thilikos, Dimitrios M.},
  title	       = {On graph contractions and induced minors},
  journal      = DAM,
  volume       = {160},
  year	       = {2012},
  number       = {6},
  pages	       = {799--809},
}
		
@article {MathiesonSzeider12,
  author       = {Mathieson, Luke and Szeider, Stefan},
  title	       = {Editing graphs to satisfy degree constraints: a
                  parameterized approach},
  journal      = JCSS,
  volume       = {78},
  year	       = {2012},
  number       = {1},
  pages	       = {179--191},
}



@article{DvorakOrdyniakSzeider12,
  author       = {Wolfgang Dvor{\'a}k and Sebastian Ordyniak and
                  Stefan Szeider},
  title	       = {Augmenting tractable fragments of abstract
                  argumentation},
  journal      = AI,
  volume       = {186},
  year	       = {2012},
  pages	       = {157--173},
}


@article{GutinKimSoleimanfallahSzeiderYeo12,
  author       = {Gregory Gutin and Eun Jung Kim and Arezou
                  Soleimanfallah and Stefan Szeider and Anders Yeo},
  title	       = {Parameterized Complexity Results for General Factors
                  in Bipartite Graphs with an Application to
                  Constraint Programming},
  journal      = Alg,
  volume       = {64},
  number       = {1},
  year	       = {2012},
  pages	       = {112--125},
}



@inproceedings{BackstromChenJonssonOrdyniakSzeider12,
  author       = {Christer B{\"a}ckstr{\"o}m and Yue Chen and Peter
                  Jonsson and Sebastian Ordyniak and Stefan Szeider},
  title	       = {The Complexity of Planning Revisited - A
                  Parameterized Analysis},
  editor       = {J{\"o}rg Hoffmann and Bart Selman},
  booktitle    = {Proceedings of the Twenty-Sixth AAAI Conference on
                  Artificial Intelligence, July 22-26, 2012, Toronto,
                  Ontario, Canada},
  publisher    = {AAAI Press},
  year	       = {2012},
}


@inproceedings{GaspersKoivistoLiedloffOrdyniakSzeider12,
  author       = {Serge Gaspers and Mikko Koivisto and Mathieu
                  Liedloff and Sebastian Ordyniak and Stefan Szeider},
  title	       = {On Finding Optimal Polytrees},
  editor       = {J{\"o}rg Hoffmann and Bart Selman},
  booktitle    = {Proceedings of the Twenty-Sixth AAAI Conference on
                  Artificial Intelligence, July 22-26, 2012, Toronto,
                  Ontario, Canada},
  publisher    = {AAAI Press},
  year	       = {2012},
}




@inproceedings{GaspersKimOrdyniakSaurabhSzeider12,
  author       = {Serge Gaspers and Eun Jung Kim and Sebastian
                  Ordyniak and Saket Saurabh and Stefan Szeider},
  title	       = {Don't Be Strict in Local Search!},
  editor       = {J{\"o}rg Hoffmann and Bart Selman},
  booktitle    = {Proceedings of the Twenty-Sixth AAAI Conference on
                  Artificial Intelligence, July 22-26, 2012, Toronto,
                  Ontario, Canada},
  publisher    = {AAAI Press},
  year	       = {2012},
}


@inproceedings{GaspersSzeider12,
  author       = {Serge Gaspers and Stefan Szeider},
  title	       = {Backdoors to Satisfaction},
  pages	       = {287--317},
  editor       = {Hans L. Bodlaender and Rod Downey and Fedor V. Fomin
                  and D{\'a}niel Marx},
  booktitle    = {The Multivariate Algorithmic Revolution and Beyond -
                  Essays Dedicated to Michael R. Fellows on the
                  Occasion of His 60th Birthday},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7370},
  year	       = {2012},
}

@inproceedings{GaspersSzeider12b,
  author       = {Serge Gaspers and Stefan Szeider},
  title	       = {Backdoors to Acyclic SAT},
  pages	       = {363--374},
  editor       = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts
                  and Roger Wattenhofer},
  booktitle    = {Automata, Languages, and Programming - 39th
                  International Colloquium, ICALP 2012, Warwick, UK,
                  July 9-13, 2012, Proceedings, Part I},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7391},
  year	       = {2012},
}


@inproceedings{FominEtal12,
  author       = {Fedor V. Fomin and Serge Gaspers and Petr
                  A. Golovach and Karol Suchan and Stefan Szeider and
                  Erik Jan van Leeuwen and Martin Vatshelle and Yngve
                  Villanger},
  title	       = {k-Gap Interval Graphs},
  pages	       = {350--361},
  editor       = {David Fern{\'a}ndez-Baca},
  booktitle    = {LATIN 2012: Theoretical Informatics - 10th Latin
                  American Symposium, Arequipa, Peru, April 16-20,
                  2012. Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7256},
  year	       = {2012},
}

@inproceedings{SlivovskySzeider12,
  author       = {Friedrich Slivovsky and Stefan Szeider},
  title	       = {Computing Resolution-Path Dependencies in Linear
                  Time},
  pages	       = {58--71},
  editor       = {Alessandro Cimatti and Roberto Sebastiani},
  booktitle    = {Theory and Applications of Satisfiability Testing -
                  SAT 2012 - 15th International Conference, Trento,
                  Italy, June 17-20, 2012. Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7317},
  year	       = {2012},
}

@inproceedings{GaspersSzeider12c,
  author       = {Serge Gaspers and Stefan Szeider},
  title	       = {Strong Backdoors to Nested Satisfiability},
  pages	       = {72--85},
  editor       = {Alessandro Cimatti and Roberto Sebastiani},
  booktitle    = {Theory and Applications of Satisfiability Testing -
                  SAT 2012 - 15th International Conference, Trento,
                  Italy, June 17-20, 2012. Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7317},
  year	       = {2012},
}





@inproceedings{DvorakSzeiderWoltran12,
  author       = {Wolfgang Dvor{\'a}k and Stefan Szeider and Stefan
                  Woltran},
  title	       = {Abstract Argumentation via Monadic Second Order
                  Logic},
  pages	       = {85--98},
  editor       = {Eyke H{\"u}llermeier and Sebastian Link and Thomas
                  Fober and Bernhard Seeger},
  booktitle    = {Scalable Uncertainty Management - 6th International
                  Conference, SUM 2012, Marburg, Germany, September
                  17-19, 2012. Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7520},
  year	       = {2012},
}


@proceedings{VerheijSzeiderWoltran12,
  editor       = {Bart Verheij and Stefan Szeider and Stefan Woltran},
  title	       = {Computational Models of Argument - Proceedings of
                  COMMA 2012, Vienna, Austria, September 10-12, 2012},
  publisher    = {IOS Press},
  series       = {Frontiers in Artificial Intelligence and
                  Applications},
  volume       = {245},
  year	       = {2012},
}



@TechReport{FichteSzeider12,
  author       = {Johannes Klaus Fichte and Stefan Szeider},
  title	       = {Backdoors to Tractable Answer-Set Programming},
  year	       = {2012},
  institution  = {Arxiv.org},
  number       = {1104.2788},
  note	       = {Extended and updated version of a paper that
                  appeared in the proceedings of IJCAI 2011, the 22nd
                  International Joint Conference on Artificial
                  Intelligence}
}





# 2011 ===================================


@article {AlonGutinKimSzeiderYeo11,
    author = {Alon, Noga and Gutin, Gregory and Kim, Eun Jung and Szeider,
              Stefan and Yeo, Anders},
     title = {Solving {MAX}-{$r$}-{SAT} above a tight lower bound},
   journal = Alg,
    volume = {61},
      year = {2011},
    number = {3},
     pages = {638--655},
}


@Article{KimOrdyniakSzeider11,
  author       = {Eun Jung Kim and Sebastian Ordyniak and Stefan
                  Szeider},
  title	       = {Algorithms and Complexity Results for Persuasive
                  Argumentation},
  journal      = AI,
  pages	       = {1722--1736},
  year	       = {2011},
  volume       = {175},
}






@article{MathiesonSzeider11,
  author = 	 {Luke Mathieson and Stefan Szeider},
  title = 	 {Editing Graphs to Satisfy Degree Constraints: A Parameterized Approach},
  journal=       JCSS,
  note = 	 {To appear},
  year = 	 2011,
}





@InProceedings{FichteSzeider11,
  author = 	 {Johannes Klaus Fichte and Stefan Szeider},
  title = 	 {Backdoors to Tractable Answer-Set Programming},
  booktitle =    {Proceedings of the 22nd International Joint Conference on 
                  Artificial Intelligence, IJCAI 2011},
  publisher  =   {AAAI Press/IJCAI}, 
  pages =        {863--868}, 
 editor =        {Toby Walsh},
  year = 	 {2011},
}



@InProceedings{OrdyniakSzeider11,
  author = 	 {Sebastian Ordyniak and Stefan Szeider},
  title = 	 {Augmenting Tractable Fragments of Abstract Argumentation},
  booktitle =    {Proceedings of the 22nd International Joint Conference on 
                  Artificial Intelligence, IJCAI 2011},
  publisher  =   {AAAI Press/IJCAI}, 
  pages =        {1033--1038}, 
 editor =        {Toby Walsh},
  year = 	 {2011},
}

@InProceedings{GaspersSzeider11,
  author = 	 {Serge Gaspers and Stefan Szeider},
  title = 	 {Kernels for Global Constraints},
  booktitle =    {Proceedings of the 22nd International Joint Conference on 
                  Artificial Intelligence, IJCAI 2011},
  publisher  =   {AAAI Press/IJCAI}, 
  pages =        {540--545}, 
 editor =        {Toby Walsh},
  year = 	 {2011},
}

@InProceedings{Szeider11a,
  author = 	 {Stefan Szeider},
  title = 	 {Limits of Preprocessing},
  booktitle =    {Proceedings of the 
                 Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011},
  pages =        {93--98}, 
  publisher =    {AAAI Press, Menlo Park, California},
  year = 	 2011,
}



@Article{Szeider11,
  author = 	 {Stefan Szeider},
  title = 	 {Monadic Second Order Logic on Graphs 
                  with Local Cardinality   Constraints},
  journal    =   ACMTCL,
  year = 	 {2011},
  volume = 	 {12},
  number = 	 {2},
  pages = 	 {article 12},
}

@article {FellowsEtAl11,
    author = {Fellows, Michael R. and Fomin, Fedor V. and Lokshtanov, Daniel
              and Rosamond, Frances and Saurabh, Saket and Szeider, Stefan
              and Thomassen, Carsten},
     title = {On the complexity of some colorful problems parameterized by
              treewidth},
   journal = InfComp,
    volume = {209},
      year = {2011},
    number = {2},
     pages = {143--153},
}



@article {Szeider11b,
    author = {Szeider, Stefan},
     title = {The parameterized complexity of {$k$}-flip local search for
              {SAT} and {MAX} {SAT}},
   journal = DO,
    volume = {8},
      year = {2011},
    number = {1},
     pages = {139--145},
}


@TECHREPORT{GaspersSzeider11a,
  author = {Serge Gaspers and Stefan Szeider},
  title = {Backdoors to Acyclic {SAT}},
  institution =  {Arxiv.org},
  year = 2011,
  number = {1110.6384},
  month  = OCT,
} 




@INPROCEEDINGS{GaspersSzeider11c,
  author = {Serge Gaspers and Stefan Szeider},
  title = {The Parameterized Complexity of Local Consistency},
  booktitle = {Proceedings of the 17th International Conference on Principles and
	Practice of Constraint Programming (CP 2011)},
  year = {2011},
  editor = {Jimmy Ho-Man Lee},
  volume = {6876},
  series = LNCS,
  pages = {302--316},
  publisher = Springer,
}


@TechReport{GaspersSzeider11b,
  author = 	 {Serge Gaspers and Stefan Szeider},
  title = 	 {Backdoors to Satisfaction},
  year = 	 {2011},
  institution =  {Arxiv.org},
  number = 	 {1110.6387},
  month = 	 OCT,
}





# 2010 #==================================================



@inproceedings{PichlerRuemmeleSzeiderWoltran10,
  author    = {Reinhard Pichler and
               Stefan R{\"u}mmele and
               Stefan Szeider and
               Stefan Woltran},
  title     = {Tractable Answer-Set Programming with Weight Constraints:
               Bounded Treewidth Is not Enough},
  editor    = {Fangzhen Lin and
               Ulrike Sattler and
               Miroslaw Truszczynski},
  booktitle     = {Principles of Knowledge Representation and Reasoning: Proceedings
               of the Twelfth International Conference, KR 2010, Toronto,
               Ontario, Canada, May 9-13, 2010},
  publisher = {AAAI Press},
  year      = {2010}
}



@Article{SamerSzeider10a, 
   author = 	 {Marko Samer and Stefan Szeider},
  title = 	 {Constraint satisfaction with bounded treewidth revisited},
  journal =       JCSS,
   volume   =       {76},
  number = {2},
  pages  = {103--114},
  year = {2010},
}


@inproceedings{AlonGutinKimSzeiderYeo10,
  author    = {Noga Alon and
               Gregory Gutin and
               Eun Jung Kim and
               Stefan Szeider and
               Anders Yeo},
  title     = {Solving {MAX}-r-{SAT} Above a Tight Lower Bound},
  year      = {2010},
  pages     = {511--517},
  editor    = {Moses Charikar},
  booktitle     = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium
               on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January
               17-19, 2010},
  publisher = {SIAM},
}



@InProceedings{OrdyniakSzeider10,
  author =	 {Sebastian Ordyniak and Stefan Szeider},
  title =	 {Algorithms and Complexity Results for Exact {Bayesian}
                  Structure Learning},
  booktitle =	 {Proceedings of UAI 2010, The 26th Conference on Uncertainty
                  in Artificial Intelligence, Catalina Island, California,
                  USA, July 8-11, 2010},
  year =	 {2010},
  editor =	 {Peter Gr\"{u}nwald and Peter Spirtes},
  publisher = {AUAI Press, Corvallis, Oregon},
}


@article {SamerSzeider10,
    author = {Samer, Marko and Szeider, Stefan},
     title = {Algorithms for propositional model counting},
   journal = JDA,
    volume = {8},
      year = {2010},
    number = {1},
     pages = {50--64},
}






@InProceedings{DvorakSzeiderWoltran10,
  author = 	 {Wolfgang Dvo\v{r}\'{a}k and Stefan Szeider and Stefan
                  Woltran},
  title = 	 {Reasoning in Argumentation Frameworks of Bounded
                  Clique-Width},
  booktitle = {Computational Models of Argumentation, Proceedings of
                  COMMA 2010},  
pages = 	 {219--230},
  year = 	 {2010},
  editor = 	 {Pietro Baroni and Federico Cerutti and Massimiliano
                  Giacomin and Guillermo R. Simari},
  volume = 	 {216},
  series = 	 {Frontiers in Artificial Intelligence and Applications},
 organization = {IOS},
}

@InProceedings{KimOrdyniakSzeider10,
  author = 	 {Eun Jung Kim and Sebastian Ordyniak and Stefan Szeider},
  title = 	 {Algorithms and Complexity Results for Persuasive Argumentation},
  booktitle = {Computational Models of Argumentation, Proceedings of
                  COMMA 2010},  
pages = 	 {311--322},
  year = 	 {2010},
  editor = 	 {Pietro Baroni and Federico Cerutti and Massimiliano
                  Giacomin and Guillermo R. Simari},
  volume = 	 {216},
  series = 	 {Frontiers in Artificial Intelligence and Applications},
 organization = {IOS},
}




@inproceedings{OrdyniakPaulusmaSzeider10,
  author    = {Sebastian Ordyniak and
               Dani{\"e}l Paulusma and
               Stefan Szeider},
  title     = {Satisfiability of Acyclic and Almost Acyclic {CNF} Formulas},
  pages     = {84--95},
  editor    = {Kamal Lodaya and
               Meena Mahajan},
  booktitle     = {IARCS Annual Conference on Foundations of Software Technology
               and Theoretical Computer Science, FSTTCS 2010, December
               15-18, 2010, Chennai, India},
  publisher = LZI,
  series    = LIPIcs,
  volume    = {8},
  year      = {2010},
}




# 2009 #==================================================




@TechReport{GutinKimSzeiderYeo09a,
    author = {Gutin, Gregory and Kim, Eun Jung and Szeider, Stefan 
              and Yeo, Anders},
  title = 	 {A Probabilistic Approach to Problems Parameterized 
            Above Tight Lower Bound},
  year = 	 {2009},
  note =    {!!!! Arxiv or IWPEC !!!!}
}




@article{SamerSzeider09,
  author = 	 {Marko Samer and Stefan Szeider},
  title = 	 {Tractable Cases of the 
                  Extended Global Cardinality Constraint},
  journal       = {Constraints},
  volume = {16},
  number = {1},
  pages = {1--24},
  year  =     {2009},
}



@article {FellowsRosamondRoticsSzeider09,
    author = {Fellows, Michael R. and Rosamond, Frances A. and Rotics, Udi
              and Szeider, Stefan},
     title = {Clique-width is {NP}-complete},
   journal = SiamJDM,
    volume = {23},
      year = {2009},
    number = {2},
     pages = {909--939},
}
	



@inproceedings{Szeider09,
  author    = {Stefan Szeider},
  title     = {The Parameterized Complexity of $k$-Flip Local Search for
               {SAT} and {MAX SAT}},
  year      = {2009},
  pages     = {276--283},
  editor    = {Oliver Kullmann},
  booktitle     = {Theory and Applications of Satisfiability Testing - SAT
               2009, 12th International Conference, SAT 2009, Swansea,
               UK, June 30 - July 3, 2009. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {5584},
}


@article{SamerSzeider09a,
    author = {Samer, Marko and Szeider, Stefan},
     title = {Backdoor sets of quantified {B}oolean formulas},
   journal = JAR,
    volume = {42},
      year = {2009},
    number = {1},
     pages = {77--97},
}




@inproceedings{GutinKimSzeiderYeo09,
  author    = {Gregory Gutin and
               Eun Jung Kim and
               Stefan Szeider and
               Anders Yeo},
  title     = {A Probabilistic Approach to Problems Parameterized above
               or below Tight Bounds},
  pages     = {234--245},
  editor    = {Jianer Chen and
               Fedor V. Fomin},
  booktitle     = {Parameterized and Exact Computation, 4th International Workshop,
               IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009,
               Revised Selected Papers},
  publisher = Springer,
  series    = LNCS,
  volume    = {5917},
  year      = {2009},
}


# 2008 #==================================================



@Article{GottlobSzeider08,
  author = 	 {Georg Gottlob and Stefan Szeider},
  title = 	 {Fixed-parameter algorithms for artificial intelligence,
  constraint satisfaction, and database problems},
  year = 	 {2008},
  note = 	 {Survey paper},
  volume  =      {51}, 
  number =       {3}, 
  pages =        {303--325},
  journal = 	 TCJ,
}





@article {GutinSzeiderYeo08,
    author = {Gutin, Gregory and Szeider, Stefan and Yeo, Anders},
     title = {Fixed-parameter complexity of minimum profile problems},
   journal = Alg,
    volume = {52},
      year = {2008},
    number = {2},
     pages = {133--152},
}




@InProceedings{Szeider08,
  author = 	 {Stefan Szeider},
  title = 	 {Monadic Second Order Logic on Graphs with Local Cardinality
  Constraints},
  booktitle     = {Mathematical Foundations of Computer Science 2008, 33rd
               International Symposium, MFCS 2008, Torun, Poland, August
               25-29, 2008, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {5162},
  pages     = {601--612},
  year      = {2008},
}

@InProceedings{Szeider08b,
  author = 	 {Stefan Szeider},
  title = 	 {Not So Easy Problems For Tree Decomposable Graphs
                  (invited talk)},
  booktitle     = {ICDM 2008, International Conference on Discrete 
                   Mathematics, June 6-10, 2008, Mysore, India, Proceedings},
  pages      = {161--171},
  year      = {2008},
}

@InProceedings{SamerSzeider08,
  author = 	 {Marko Samer and Stefan Szeider},
  title = 	 {Tractable Cases of the 
                  Extended Global Cardinality Constraint},
  booktitle = {Proceedings of CATS 2008, Computing: The Australasian
Theory Symposium, University of Wollongong, New South Wales,
Australia, January 22-25, 2008},
  pages = 	 {67--74},
  year = 	 {2008},
  editor = 	 {J. Harland and P. Manyem},
  volume = 	 {77},
  series = 	 {Conferences in Research and Practice in 
                  Information Technology},
  publisher =    {Australian Computer Society},
}


@InProceedings{SamerSzeider08b,
  author = 	 {Marko Samer and Stefan Szeider},
  title = 	 {Backdoor Trees},
  booktitle =    {AAAI 08, Twenty-Third Conference on Artificial 
                 Intelligence,   Chicago, Illinois, July 13--17, 2008},
  year = 	 {2008},
  pages =       {363--368}, 
  publisher   =  {AAAI Press},
}


@InProceedings{MathiesonSzeider08,
  author = 	 {Luke Mathieson and Stefan Szeider},
  title = 	 {The Parameterized Complexity of Regular
Subgraph Problems and Generalizations},
  booktitle = {Proceedings of CATS 2008, Computing: The Australasian
Theory Symposium, University of Wollongong, New South Wales,
Australia, January 22-25, 2008},
  pages = 	 {79--86},
  year = 	 {2008},
  editor = 	 {J. Harland and P. Manyem},
  volume = 	 {77},
  series = 	 {Conferences in Research and Practice in 
                  Information Technology},
  publisher =    {Australian Computer Society},
}





@Article{Szeider08c,
  author = 	 {Stefan Szeider},
  title = 	 {Matched Formulas and Backdoor Sets},
  Journal = 	 JSAT,
  pages =        {1--12},
  volume  =       {6},
  year = 	 {2008},
}


@InCollection{SamerSzeider08c,
  author = 	 {Marko Samer and Stefan Szeider},
  title = 	 {Fixed-Parameter Tractability},
  booktitle = 	 {Handbook of Satisfiability},
  publisher =  {IOS Press},
  year = 	 {2009},
  editor = 	 {Armin Biere and Marijn Heule and 
                    Hans van Maaren and Toby Walsh},
  chapter = 	 {13},
  pages =        {425--454},
}


@incollection{Szeider08d,
  author    = {Stefan Szeider},
  title     = {Parameterized {SAT}},
  booktitle = {Encyclopedia of Algorithms},
  year      = {2008},
  editor    = {Ming-Yang Kao},
  publisher = Springer,
}



# 2007 #==================================================


@InProceedings{SamerSzeider07a, 
  author = 	 {Marko Samer and Stefan Szeider},
  title = 	 {Backdoor Sets of Quantified Boolean Formulas},
  booktitle =    {Proceedings of SAT 2007, Tenth International Conference on 
                  Theory and Applications of Satisfiability Testing, 
                  May 28-31, 2007, Lisbon, Portugal,},
  year = 	 {2007},
  series = 	 LNCS,
  volume = 	 {4501},
  editor =       {J. Marques-Silva and K. A. Sakallah},
  pages  =       {230­-243},
}

@InProceedings{Szeider07a, 
  author = 	 {Stefan Szeider},
  title = 	 {Matched Formulas and Backdoor Sets},
  booktitle =    {Proceedings of SAT 2007, Tenth International Conference on 
                  Theory and Applications of Satisfiability Testing, 
                  May 28-31, 2007, Lisbon, Portugal,},
  year = 	 {2007},
  series = 	 LNCS,
  volume = 	 {4501},
  editor =       {J. Marques-Silva and K. A. Sakallah},
  pages  =       {94--99},
}







@Article{GutinRafieySzeiderYeo07,
  author = 	 {Gregory Gutin and Arash Rafiey and Stefan Szeider 
                 and Anders Yeo },
  title = 	 {The Linear Arrangement Problem Parameterized 
                  Above Guaranteed Value},
  journal = 	 TCSys,
  year = 	 {2007},
  pages =        {521--538},
  volume =        {41},
}





@InProceedings{SamerSzeider07b, 
  author = 	 {Marko Samer and Stefan Szeider},
  title = 	 {Algorithms for Propositional Model Counting},
  booktitle =    {Proceedings of LPAR 2007, 
                  14th International Conference on
                   Logic for Programming, Artificial Intelligence and 
                  Reasoning, October 15-19, 2007 Yerevan, Armenia},
  year = 	 {2007},
  series = 	 LNCS,
 volume =         {4790},
  pages =        {484--498},
  publisher =    Springer},
}




@InProceedings{DantchevMartinSzeider07,
  author = 	 {Stefan Dantchev and Barnaby Martin and Stefan Szeider},
  title = 	 {Parameterized Proof Complexity},
  booktitle =    {Proceedings of the 48th Annual Symposium on Foundations of 
                  Computer Science (FOCS 2007), October 20-23, 2007, 
                  Providence, RI, USA},
  pages = 	 {150--160},
  year = 	 {2007},
  publisher =    {IEEE Press},
}



@Article{NishimuraRagdeSzeider07,
  author = 	 {Naomi Nishimura and Prabhakar Ragde and Stefan Szeider},
  title = 	 {Solving \#{S}{A}{T} using Vertex Covers},
  journal =      ActaInf,
  pages =        {509-523},
  volume =       {44},
  number =       {7-8},
  year =         {2007},
}

@inproceedings{FellowsEtal07,
  author    = {Michael R. Fellows and
               Fedor V. Fomin and
               Daniel Lokshtanov and
               Frances A. Rosamond and
               Saket Saurabh and
               Stefan Szeider and
               Carsten Thomassen},
  title     = {On the Complexity of Some Colorful Problems Parameterized
               by Treewidth},
  booktitle = {Proceedings of COCOA 2007, 
               Combinatorial Optimization and Applications, First International
               Conference, Xi'an, China, August 14-16, 2007},
  year      = {2007},
  pages     = {366-377},
  series    = LNCS,
  volume    = {4616},
  publisher = Springer,
}



@InProceedings{Szeider07c,
  author = 	 {Stefan Szeider},
  title = 	 {Without Loss of Generality -- Symmetric Reasoning for 
                  Resolution Systems (Invited Talk)},
  booktitle =     {Proceedings of SymCon'07, Seventh International Workshop 
                   on Symmetry and Constraint Satisfaction Problems, 
                  satellite workshop of CP 2007, September 23, 2007, 
                  Providence, RI, USA},
  pages = 	 {5--8},
  year = 	 {2007},
  editor = 	 {B. Benhamou},
}


# 2006 #==================================================


@Article{FellowsSzeiderWrightson06,
 author = 	 {Michael R. Fellows and Stefan Szeider and Graham Wrightson},
  title = 	 {On Finding Short Resolution Refutations and 
                  Small Unsatisfiable Subsets}, 
  journal = 	 TCS,
  year = 	 {2006},
  volume = 	 {351},
  number = 	 {3},
  pages = 	 {351--359},
}



@InProceedings{NishimuraRagdeSzeider06,
  author = 	 {Naomi Nishimura and Prabhakar Ragde and Stefan Szeider},
  title = 	 {Solving \#{S}{A}{T} using Vertex Covers},
  booktitle = {Proceedings of SAT 2006, Ninth International Conference on 
               Theory and Applications of Satisfiability Testing,  
                August 12-15, 2006, Seattle, Washington, USA},
  pages = 	 {396--409},
  year = 	 {2006},
  volume = 	 {4121},
  series = 	 LNCS,
}

@article {HoorySzeider06,
  author = 	 {Shlomo Hoory and Stefan Szeider},
  title = 	 {A note on of unsatisfiable $k$-{CNF} formulas with 
                  few occurrences per variable},
  journal = SiamJDM,
    volume = 20,
      year = 2006,
    number = 2,
     pages = {523--528},
}




@InProceedings{FellowsRosamondRoticsSzeider06,
  Author =	 {Michael R. Fellows and Frances A. Rosamond and Udi Rotics
                  and Stefan Szeider},
  title =	 {Clique-width Minimization is {NP}-hard},
  booktitle =	 {Proceedings of STOC 2006; the 38th ACM Symposium on Theory
                  of Computing, Seattle, Washington, USA},
  year =	 {2006},
  publisher =	 {ACM},
  pages =	 {354--362},
  note =	 {Full version appeared in the SIAM Journal on Discrete
                  Mathematics vol. 23, no. 2, pp. 909-939, 2009},
}


@TechReport{DantchevMartinSzeider06-NI,
  author = 	 {Stefan Dantchev and Barnaby Martin and Stefan Szeider},
  title = 	 {Parameterized Proof Complexity: a Complexity Gap 
                  for Parameterized Tree-like Resolution},
  institution =  {Isaac Newton Institute Preprint Series},
  year = 	 {2006},
  month = 	 Nov,
  number = 	 {NI06054-LAA},
  note = 	 {\url{http://www.newton.cam.ac.uk/preprints2006.html}},
}

@TechReport{DantchevMartinSzeider06,
  author = 	 {Stefan Dantchev and Barnaby Martin and Stefan Szeider},
  title = 	 {Parameterized Proof Complexity: a Complexity Gap 
                  for Parameterized Tree-like Resolution},
  number = 	 {TR07-001},
  institution =  ECCC,
 year = 	 {2007},
  month = 	 Jan,
}


@InProceedings{SamerSzeider06, 
   author = 	 {Marko Samer and Stefan Szeider},
  title = 	 {Constraint satisfaction with bounded treewidth revisited},
  booktitle =    {Proceedings of CP 2006 , Twelfth International 
                  Conference on Principles and Practice of Constraint 
                  Programming, September 24-29, 2006, Nantes, France},
  year = 	 {2006},
  series = 	 LNCS,
  volume =       {4204}, 
  pages  =       {499--513},
  note   =       {Full and corrected version available at 
                 \url{http://www.dur.ac.uk/stefan.szeider/abstract24.html}}, 
}

@TechReport{SamerSzeider06b,
    author =      {Marko Samer and Stefan Szeider},
    title =       {A fixed-parameter algorithm for \#{SAT} with 
                   parameter incidence treewidth},
    year = 	 {2006},
    number = 	 {arXiv:cs.DS/0610174},
}



@InProceedings{GutinSzeiderYeo06b,
  author = 	 {Gregory Gutin and Anders Yeo and Stefan Szeider},
  title = 	 {Fixed-Parameter Complexity of Minimum Profile Problems},
  booktitle = {Proceedings of IWPEC 2006, 2nd International Workshop on Parameterized and Exact Computation},
  pages = 	 {60-71},
  year = 	 {2006},
  volume = 	 {4169},
  series = 	 LNCS,
  publisher = Springer,
}



# 2005 #==================================================

@Article{Szeider05,
  author = 	 {Stefan Szeider},
  title = 	 {Generalizations of matched {C}{N}{F} formulas},
  journal = 	 AMAI,
  volume  =      {43},
  number  =      {1-4},
  pages  =       {223--238},
  year =         {2005},
}

@Article{FellowsRosamondRoticsSzeider05a,
  author = 	 {Michael R. Fellows and  Frances A. Rosamond 
                  and Udi Rotics and Stefan Szeider},
  title = 	 {Proving {NP}-hardness for clique-width {I}: 
                  non-approximability of sequential clique-width},
  year = 	 {2005},
  journal = 	 {Electronic Colloquium on Computational Complexity},
  volume = 	 {Report TR05-080, Revision 01},
}
@Article{FellowsRosamondRoticsSzeider05,
  author = 	 {Michael R. Fellows and  Frances A. Rosamond 
                  and Udi Rotics and Stefan Szeider},
  title = 	 {Proving {NP}-hardness for clique-width {II}: 
                  non-approximability of clique-width},
  year = 	 2005,
  journal = 	 {Electronic Colloquium on Computational Complexity},
  volume = 	 {Report TR05-081, Revision 01},
}
 



@Unpublished{GutinRafieySzeiderYeo05c,
  author = 	 {Gregory Gutin and Arash Rafiey and 
                  Stefan Szeider and Anders Yeo},
  title = 	 {The Linear Arrangement Problem Parameterized  
                  Above Guaranteed Value},
  note = 	 {arXiv.org e-Print archive, paper cs.DS/0511030},
  month = 	 NOV,
  year = 	 2005,
}



@Article{Szeider05d,
  author = 	 {Stefan Szeider},
  title = 	 {Backdoor Sets for {DLL} Subsolvers},
  journal = 	 JAR,
   volume  =     {35},
   number  =     {1-3},
  pages =        {73--88},
 year = 	 2005,
  note = 	 {Reprinted as Chapter 4 of the book SAT 2005 - 
                  Satisfiability Research in the Year 2005, 
                  edited by E. Giunchiglia and T. Walsh, 
                  Springer Verlag, 2006},
}
@Article{Szeider05e,
  author = 	 {Stefan Szeider},
  title = 	 {The Complexity of Resolution with 
                  Generalized Symmetry Rules},
  journal = 	 TCSys,
  year = 	 {2005},
  volume = 	 {38},
  number = 	 {2},
  pages = 	 {171--188},
}



@Article{FleischnerSzeider05,
  author = 	 {Herbert Fleischner and Stefan Szeider},
  title = 	 {On Edge-Colored Graphs Covered by Properly Colored Cycles},
  journal =      GC,
  year = 	 {2005},
  volume = 	 {21},
  number = 	 {3},
  pages = 	 {301-206},
}




@article {HoorySzeider05,
    author = {Hoory, Shlomo and Szeider, Stefan},
     title = {Computing unsatisfiable {$k$}-{SAT} instances with few
              occurrences per variable},
   journal = TCS,
    volume = {337},
      year = {2005},
    number = {1-3},
     pages = {347--359},
}



# 2004 #==================================================

@InProceedings{Szeider04a,
  author = 	 {Stefan Szeider},
  title = 	 {The Parameterized Complexity of {SAT} Backdoors},
  booktitle = 	 {Computing: The Australasian Theory Symposium (CATS 2004)},
  pages = 	 {252--261},
  year = 	 2004,
  editor = 	 {Mike Atkinson},
  organization = {University of Ontago},
  note = 	 {Informal Proceedings},
  anote =        { 03g -> 04a},
}


@InProceedings{NishimuraRagdeSzeider04-informal,
  author = 	 {Naomi Nishimura and Prabhakar Ragde and Stefan Szeider},
  title = 	 {Detecting Backdoor Sets with Respect to {Horn} and Binary
                  Clauses},
  booktitle = 	 {Proceedings of  SAT 2004 (Seventh International
                  Conference on Theory and Applications of Satisfiability 
                  Testing, 10--13 May, 2004, Vancouver, BC, Canada)},
  year = 	 {2004},
  pages =        {96--103},
}


@InProceedings{Szeider04b,
  author = 	 {Stefan Szeider},
  title = 	 {On fixed-parameter tractable parameterizations 
                 of {S}{A}{T}},
  booktitle = 	 {Theory and Applications of Satisfiability,
                  6th International Conference, SAT 2003,
                  Selected and Revised Papers},
  year = 	 {2004},
   series = 	 LNCS,
  volume =        {2919},
  editor =        {Enrico Giunchiglia and Armando Tacchella},
  publisher =     Springer,
  pages  = 	  {188--202},
}



@Article{Szeider04d,
  author = 	 {Stefan Szeider},
  title = 	 {Minimal unsatisfiable formulas with bounded 
                  clause-variable difference are fixed-parameter tractable},
  journal = 	 JCSS,
  year = 	 {2004},
  volume = 	 {69},
  number = 	 {4},
  pages = 	 {656--674},
}

@InProceedings{FellowsSzeiderWrightson04,
  author = 	 {Michael R. Fellows and Stefan Szeider and Graham Wrightson},
  title = 	 {On Finding Short Resolution Refutations and 
                  Small Unsatisfiable Subsets},
  booktitle =    {1st International Workshop on Parameterized and 
                  Exact Computation (IWPEC 2004)},
  pages = 	 {223--234},
  year = 	 {2004},
  editor = 	 {Rod Downey and Michael Fellows and Frank Dehne},
  volume = 	 {3162},
  series = 	 {Lecture Notes in Computer Science},
  publisher =    {Springer},
}



@Article{Szeider04c,
  author = 	 {Stefan Szeider},
  title = 	 {On Theorems Equivalent with {K}otzig's Result on Graphs 
                  with Unique 1-Factors},
  journal = 	 {Ars Combinatoria},
  year = 	 {2004},
  volume = 	 {73},
  pages = 	 {53--64},
}


@Unpublished{HoorySzeider04-becomes06,
  author = 	 {Shlomo Hoory and Stefan Szeider},
  title = 	 {Families of unsatisfiable $k$-{CNF} formulas with 
                  few occurrences per variable},
  note = 	 {arXiv.org e-Print archive, paper math.CO/0411167},
  month =        NOV,
  year  =        {2004}, 
}



# 2003 #==================================================

@Article{Szeider03,
  author = 	 {Stefan Szeider},
  title = 	 {Finding paths in graphs  avoiding  forbidden transitions},
  journal = 	 DAM,
  year = 	 {2003},
  volume = 	 {126},
  number = 	 {2-3},
  pages = 	 {239-251},
}


@TechReport{Szeider03b,
  author = 	 {Stefan Szeider},
  title = 	 {Minimal unsatisfiable formulas with bounded 
                  clause-variable difference are fixed-parameter tractable},
  institution =  ECCC,
  number = 	 {TR03--002, Revision~1},
  year = 	 {2003},
}


@InProceedings{Szeider03c,
  author = 	 {Stefan Szeider},
  title = 	 {The complexity of resolution with generalized 
                  symmetry rules }, 
  booktitle = 	 {Proceedings of the 20th International Symposium on 
                  Theoretical Aspects of Computer Science (STACS'03)},
  year = 	 {2003},
  editor = 	 {Helmut Alt and Michel Habib},
  series = 	 LNCS,
  volume =       {2607},
  pages  =       {475--486},
}

@InProceedings{Szeider03d,
  author = 	 {Stefan Szeider},
  title = 	 {Minimal unsatisfiable formulas with bounded 
                  clause-variable difference are fixed-parameter tractable},
  booktitle = 	 {Proceedings of the 9th International Computing and 
                  Combinatorics Conference (COCOON'03)},
  year = 	 {2003},
  editor = 	 {T. Warnow and B. Zhu},
  volume = 	 {2697},
  series = 	 LNCS,
  publisher =    Springer,
  pages     =    {548--558},
}

@Article{Szeider03e,
  author = 	 {Stefan Szeider},
  title = 	 {Homomorphisms of Conjunctive Normal Forms},
  journal = 	 DAM,
  volume = 	 {130},
  number = 	 {2},
  pages = 	 {351--365},
  year = 	 {2003},
} 


@TechReport{Szeider03f,
  author = 	 {Stefan Szeider},
  title = 	 {Minimal unsatisfiable formulas with bounded 
                  clause-variable difference are fixed-parameter tractable},
  institution =  ECCC,
  number = 	 {TR03--002, Revision~1},
  year = 	 {2003},
}



# 2002 #==================================================

@inProceedings{Szeider02-informal, 
  author = 	 {Stefan Szeider},
  title = 	 {Generalizations of matched {C}{N}{F} formulas},
  year = 	 {2002},
  editor = 	 {John Franco},
  pages =        {292--307},
  month = 	 May,
  booktitle   =  {Proceedings of the Fifth International 
                  Symposium on the Theory and Applications of
                  Satisfiability Testing (SAT 2002) 
                  Cincinnati, Ohio, USA, May 6--9, 2002},
}

@article {FleischnerKullmannSzeider02,
    author = {Fleischner, Herbert and Kullmann, Oliver and Szeider, Stefan},
     title = {Polynomial-time recognition of minimal unsatisfiable formulas
              with fixed clause-variable difference},
   journal = TCS,
    volume = {289},
      year = {2002},
    number = {1},
     pages = {503--516},
}
	
 

# 2001 #==================================================

@InProceedings{Szeider01,
  author = 	 {Stefan Szeider},
  title = 	 {{NP}-Completeness of
                  Refutability by  Literal-Once Resolution},
  booktitle = 	 {IJCAR 2001, Proceedings of the International 
                  Joint Conference on Automated Reasoning}, 
  year = 	 {2001},
  editor =       {R. Gor\'{e} and A. Leitsch and T. Nipkow},
  series = 	 LNAI,
  volume =       {2083},
  publisher =   Springer,
  pages =      {168--181},
}


@Unpublished{Szeider01a,
  author = 	 {Stefan Szeider},
  title = 	 {The Universality of Refutation by Homomorphism},
  year = 	 {2001},
  note = 	 {In preparation},
}

@PhdThesis{Szeider01b,
  author = 	 {Stefan Szeider},
  title = 	 {Conjunctive Normal Forms with Bounded Deficiency},
  school = 	 {University of Vienna},
  year = 	 {2001},
  month = 	 Sep,
}

@TechReport{Szeider01c,
  author = 	 {Stefan Szeider},
  title = 	 {Homomorphisms and Propositional Proofs},
  year = 	 {2001},
  type = 	 {Project Proposal},
  address = 	 {Institute of Discrete Mathematics, 
                  Austrian Academy of Science}, 
  month = 	 Jun,
}



# 2000 and earlier #==================================================

@mastersthesis{Szeider97,
    author  = {Szeider, Stefan},
    title   = {Proof Graphs and Structural Validity},
    year    = {1997},
    month   = nov,
    school  = {University of Vienna},
}



@unpublished{SzeiderInfPrak,
    author  = {Szeider, Stefan},
    title   = {{A}lgorithmen und {D}atenstrukturen zur 
               {R}epr{\"a}sentation und {M}anipulation von {B}eweisgraphen},
    month   = sep,
    year    = {1997},
    note    ={Informatikpraktikum, Technical University of Vienna,
     Institut f\"{u}r Computersprachen},
}

@unpublished{Szeider98,
    author  = {Szeider, Stefan},
    title   = {Global Restrictions on Proper Parameters},
    month   = jan,
    year    = {1998},
    note    ={Unpublished Ma\-nu\-script},
}


@Unpublished{Szeider00b,
  author = 	 {Stefan Szeider},
  title = 	 {How to prove unsatisfiability by homomorphisms},
  year = 	 {2000},
  note = 	 {Submitted to \emph{Discrete Applied Mathematics}},
}


@Unpublished{Szeider00c,
  author = 	 {Stefan Szeider},
  title = 	 {Acyclic Formulas and Minimal Unsatisfiability},
  year = 	 {2000},
  note =         {Preprint},
}



# AAA #==================================================




@article {AbrahamsonDowneyFellows95,
    author = {Abrahamson, Karl A. and Downey, Rodney G. and Fellows, Michael
              R.},
     title = {Fixed-parameter tractability and completeness. {I}{V}. {O}n
              completeness for {W}[{P}] and {P}{S}{P}{A}{C}{E} analogues},
   journal = APAL,
    volume = {73},
      year = {1995},
    number = {3},
     pages = {235--276},
}



@InProceedings{AdlerGottlobGrohe05,
  author = 	 {Isolde Adler and Georg Gottlob and Martin Grohe},
  title = 	 {Hypertree-Width and Related Hypergraph Invariants},
  booktitle =    {Proceedings of the 3rd European Conference on 
                  Combinatorics, Graph Theory and Applications (EUROCOMB'05)},
  pages = 	 {5--10},
  year = 	 {2005},
  volume = 	 {AE},
  series = 	 {DMTCS Proceedings Series},
}

@InProceedings{EFLRacid05,
  author =    {Vladimir Estivill-Castro 
               and Michael R. Fellows
               and Michael A. Langston
	       and Frances A. Rosamond},
  title =      {{FPT} is {P-Time} Extremal Structure {I}},
  booktitle =  {Algorithms and Complexity in Durham 2005, 
               Proceedings of the first ACiD Workshop},
  pages =      {1--41},
  year =       {2005},
  editor =     {Hajo Broersma and Matthew Johnson and Stefan Szeider},
  volume =     {4},
  series =     {Texts in Algorithmics},
  publisher =  {King's College Publications},
}





@Article{AharoniLinial86,
  author = 	 {Ron Aharoni and Nathan Linial},
  title = 	 {Minimal Non-Two-Colorable Hypergraphs and
                  Minimal Unsatisfiable Formulas},
  journal = 	  JCombTA,
  year = 	 {1986},
  volume = 	 {43},
  pages = 	 {196--204},

}



@article {AharoniHaxell00,
    author = {Aharoni, Ron and Haxell, Penny},
     title = {Hall's theorem for hypergraphs},
   journal = JGT,
    volume = {35},
      year = {2000},
    number = {2},
     pages = {83--88},
}

@book {AhoHopcroftUllman,
    author = {Aho, Alfred V. and Hopcroft, John E. and Ullman, Jeffrey D.},
     title = {Data structures and algorithms},
    series = {Addison-Wesley Series in Computer Science and Information
              Processing},
 publisher = {Addison-Wesley Publishing Co., Reading, Mass.},
      year = {1983},
}

@article {AlekhnovichBussMoranPitassi01,
    author = {Alekhnovich, Michael and Buss, Sam and Moran, Shlomo and
              Pitassi, Toniann},
     title = {Minimum propositional proof length is {NP}-hard to linearly
              approximate},
   journal = JSL,
    volume = {66},
      year = {2001},
    number = {1},
     pages = {171--191},
}

@inproceedings{AlekhnovichRazborov01,
    author = {Alekhnovich, Michael and Razborov, Alexander A.},
     title = {Resolution is not automatizable unless {W}[{P}] is tractable},
 booktitle = {42nd IEEE Symposium on Foundations of Computer Science 
              (FOCS 2001)},
     pages = {210--219},
 publisher = IEEE,
      year = {2001},
}

@InProceedings{AlekhnovichRazborov02,
  author = 	 {Michael Alekhnovich and Alexander A. Razborov},
  title = 	 {Satisfiability, Branch-Width and {T}seitin Tautologies},
  booktitle = 	 {Proc. of the 43rd Annual IEEE Symposium on 
                 Foundations of Computer Science (FOCS'02)},
  pages = 	 {593--603},
  year = 	 {2002},
}

@Article {AltEtAl91,
   author = {Alt, H. and Blum, N. and Mehlhorn, K. and Paul, M.},
   title = {Computing a maximum cardinality matching in a bipartite graph
             in time ${O}(n^{1.5}\sqrt{m/\log n})$},
   journal = IPL,
   volume = {37},
   year = {1991},
   number = {4},
   pages = {237--240},
}

@InProceedings{Amir01,
  author = 	 {E. Amir},
  title = 	 {Efficient approximations for triangulation of minimum treewidth},
  booktitle = 	 {Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI'01)},
  pages = 	 {7--15},
  publisher = 	 MC,
  year = 	 {2001},
}

@TechReport{Amir02,
  author = 	 {E. Amir},
  title = 	 {Approximation Algorithms for Treewidth},
  institution =  {University of Illinois, Urbana-Champaign},
  year = 	 {2002},
}



@article {Arai96,
    author = {Arai, Noriko H.},
     title = {Tractability of cut-free {G}entzen type propositional calculus
              with permutation inference},
   journal = TCS,
    volume = {170},
      year = {1996},
    number = {1-2},
     pages = {129--144},
}


@article {Arai00,
    author = {Arai, Noriko H.},
     title = {Tractability of cut-free {G}entzen-type propositional calculus
              with permutation inference. {I}{I}},
   journal = TCS,
    volume = {243},
      year = {2000},
    number = {1-2},
     pages = {185--197},
}


@article {Arai00a,
    author = {Arai, Noriko H.},
     title = {No feasible monotone interpolation for simple combinatorial
              reasoning},
   journal = TCS,
    volume = {238},
      year = {2000},
    number = {1-2},
     pages = {477--482},
}




@InProceedings{AraiUrquhart00,
  author = 	 {Noriko H. Arai and Alasdair Urquhart},
  title = 	 {Local symmetries in propositional logic},
  booktitle = 	 {Automated Reasoning with Analytic Tableaux and 
                  Related Methods (Proc. TABLEAUX 2000)},
  pages = 	 {40--51},
  year = 	 {2000},
  editor = 	 {Dyckhoff, R.},
  volume = 	 {1847},
  series = 	 LNCS,
  publisher =    Springer,
}

@article {ArnborgCorneilProskurowski87,
    author = {Arnborg, Stefan and Corneil, Derek G. and Proskurowski,
              Andrzej},
     title = {Complexity of finding embeddings in a {$k$}-tree},
   journal = SiamJADM,
    volume = {8},
      year = {1987},
    number = {2},
     pages = {277--284},
}
@article {AspvallPlassTarjan79,
    author = {Aspvall, Bengt and Plass, Michael F. and Tarjan, Robert Endre},
     title = {A linear-time algorithm for testing the truth of certain
              quantified {B}oolean formulas},
   journal = IPL,
    volume = {8},
      year = {1979},
    number = {3},
     pages = {121--123},
}

@book{AsratianDenleyHaeggkvist98,
    author = {Asratian, Armen S. and Denley, Tristan M. J. and
              H{\"a}ggkvist, Roland},
     title = {Bipartite graphs and their applications},
 publisher = CamUP,
      year = {1998},
}



@book {AusielloEtAl99,
    author = {Ausiello, G. and Crescenzi, P. and Gambosi, G. and Kann, V.
              and Marchetti-Spaccamela, A. and Protasi, M.},
     title = {Complexity and approximation},
 publisher = Springer,
      year = {1999},
}



# BBB #==================================================



@inproceedings{BaazFL94,
    author  = {Matthias Baaz and C. G. Ferm\"{u}ller and A. Leitsch},
    title   = {A non-elementary speed-up in proof length by structural
               clause form transformation}, 
    booktitle = {Proc. 19th Annual IEEE Symposium on Logic in 
               Computer Science, LICS'94},
    year    = {1994},
    publisher = {IEEE Computer Society Press},
    pages   = {213--219},
}


@inproceedings{BaazL90,
    author  = {Matthias Baaz and A. Leitsch},
    title   = {A strong problem reduction method based on 
               function introduction},
    booktitle = {Proc. ISSAC'90},
    year    = {1990},
    pages   = {30--37},
}


@article{BaazL92,
    author  = {Matthias Baaz and A. Leitsch},
    title   = {Complexity of resolution proofs and function introduction},
    journal = APAL,
    year    = {1992},
    volume  = {57},
    pages   = {181--215},
}


@article{BaazL94,
    author  = {Matthias Baaz and A. Leitsch},
    title   = {On {S}kolemization and proof complexity},
    journal = FInf,
    year    = {1994},
    volume  = {20},
    number  = {4},
    pages   = {353--379},
}


@inproceedings{BaazZ93,
    author  = {Matthias Baaz and R. Zach},
    title   = {Algorithmic structuring of cut-free proofs},
    booktitle = {Selected papers from CSL'92},
    year    = {1993},
    publisher = Springer,
    number  = {702},
    pages   = {29--42},
    series  = LNCS 
}


@InProceedings{BacchusDalmaoPitassi03,
  author = 	 {Fahiem Bacchus and Shannon Dalmao and Toniann Pitassi},
  title = 	 {Algorithms and Complexity Results for \#{S}{A}{T} 
                  and {B}ayesian Inference},
  booktitle = 	 {44th Annual IEEE Symposium on Foundations of 
                  Computer Science (FOCS'03)},
    pages   =    {340-351},
  year       =   {2003},
}



@inproceedings{BacchusWinter03,
  author    = {Fahiem Bacchus and
               Jonathan Winter},
  title     = {Effective Preprocessing with Hyper-Resolution and Equality
               Reduction.},
  booktitle = {Theory and Applications of Satisfiability Testing, 
               6th International
               Conference, SAT 2003. Santa Margherita Ligure, Italy, May
               5-8, 2003 Selected Revised Papers},
  publisher = Springer,
  series    = LNCS,
  volume    = {2919},
  year      = {2004},
  pages     = {341--355},
}




@Article{BangjensenGutin98,
  author = 	 {Bang-Jensen, J{\o}rgen and Gutin, Gregory},
  title = 	 {Alternating cycles and paths in edge-coloured multigraphs:
                  a survey},
  journal = 	  DM,
  year = 	 {1997},
  volume = 	 {165/166},
  number = 	 {},
  pages = 	 {39--60},
}

@article {BangjensenGutin98b,
    author = {Bang-Jensen, J{\o}rgen and Gutin, Gregory},
     title = {Alternating cycles and trails in $2$-edge-coloured complete
              multigraphs},
   journal = DM,
    volume = {188},
      year = {1998},
    number = {1--3},
     pages = {61--72},
}






@Book{BangjensenGutin00,
  author = 	 {Bang-Jensen, J{\o}rgen and Gutin, Gregory},
  title = 	 {Digraphs: Theory, Algorithms, Applications},
  publisher = 	 Springer,
  address =      {London},
    year = 	 {2001},
  series = 	 {Springer Monographs in Mathematics},
}





@incollection {BeamePitassi01,
    author = {Beame, Paul and Pitassi, Toniann},
     title = {Propositional proof complexity: past, present, and future},
 booktitle = {Current trends in theoretical computer science},
     pages = {42--70},
 publisher = {World Sci. Publishing},
   address = {River Edge, NJ},
      year = {2001},
}


@article {BeeriFaginMaierYannakakis83,
    author = {Beeri, Catriel and Fagin, Ronald and Maier, David and
              Yannakakis, Mihalis},
     title = {On the desirability of acyclic database schemes},
   journal = JACM,
    volume = {30},
      year = {1983},
    number = {3},
     pages = {479--513},
}



@article {BeinekePlummer67,
    author = {Beineke, Lowell W. and Plummer, Michael D.},
     title = {On the $1$-factors of a non-separable graph},
   journal = JCombT,
    volume = {2},
      year = {1967},
     pages = {285--289}
}






@InProceedings{Benedetti05,
  author = 	 {Marco Benedetti},
  title = 	 {Quantifier Trees for {Q}{B}{Fs}},
  booktitle = {Proceedings of SAT 2005, 8th International Conference on
               Theory and Applications of 
            Satisfiability Testing},
  pages = 	 {378--385},
  year = 	 {2005},
  volume = 	 {3569},
  series = 	 {LNCS},
}



@Article{BenhamouSais94,
  author = 	 {Belaid Benhamou and Lakhdar Sais},
  title = 	 {Tractability Through Symmetries in Propositional Calculus},
  journal = 	 JAR,
  year = 	 {1994},
  volume = 	 {12},
  pages = 	 {89--102},
}

@article {BenSassonWigderson01,
    author = {Ben-Sasson, Eli and Wigderson, Avi},
     title = {Short proofs are narrow---resolution made simple},
   journal = JACM,
    volume = {48},
      year = {2001},
    number = {2},
     pages = {149--169},
}



@book{Beineke97,
    title   = {Graph Connections. Relationships between Graph 
               Theory and other Areas of Mathematics},
    year    = {1997},
    editor  = {Beineke, Lowell W. and Wilson, Robin J.},
    publisher = {Oxford University Press},
}

@article {BellantoniPitassiToniannUrquhart92,
    author = {Bellantoni, Stephen and Pitassi, Toniann and Urquhart,
              Alasdair},
     title = {Approximation and small-depth {F}rege proofs},
   journal = SiamJC,
    volume = {21},
      year = {1992},
    number = {6},
     pages = {1161--1179},
}



@article {BenkouarManoussakisSaad94,
    author = {Benkouar, A. and Manoussakis, Y. and Saad, R.},
     title = {Alternating cycles through fixed vertices in edge-colored
              graphs},
   journal = JCMCC,
    volume = {16},
      year = {1994},
     pages = {199--207},
}







@Article{Berge57,
  author = 	 {Claude Berge},
  title = 	 {Two theorems in graph theory},
  journal = 	 {Proc. Nat. Acad. Sci. U.S.A.},
  year = 	 {1957},
  volume = 	 {43},
  pages = 	 {842--844},
}

@book{Berge89,
    author  = {Berge, Claude},
    title   = {Hypergraphs},
    year    = 1989,
    publisher = {North--Holland},
    address = {Amsterdam},
}







@TechReport{BermanKarpinskiScott03,
  author = 	 {Piotr Berman and Marek Karpinski and Alex D. Scott},
  title = 	 {Approximation Hardness and Satisfiability of 
                  Bounded Occurrence Instances of {SAT}},
  year = 	 {2003},
  number = 	 {TR03-022},
  institution =  ECCC,
}

@article {Bibel81,
    author = {Bibel, Wolfgang},
     title = {On matrices with connections},
   journal = JACM,
    volume = {28},
      year = {1981} ,
    number = {4},
     pages = {633--645},
}




@InProceedings{BjesseLeonardMokkedem01,
  author = 	 {Per Bjesse and Tim Leonard and Abdel Mokkedem},
  title = 	 {Finding Bugs in an Alpha Microprocessor Using 
                  Satisfiability Solvers},
  booktitle = {Computer Aided Verification: 13th International Conference, 
              CAV 2001, Paris, France, July 18-22, 2001, Proceedings},
  editor = {G. Berry and H. Comon and A. Finkel},
  pages = 	 {454--464},
  year = 	 {2001},
}



@TechReport{Blum91,
  author = 	 {N. Blum},
  title = 	 {{J}ack {E}dmonds original algorithm needs 
                  only ${O}(n^3)$ time},  
  institution =  {University of Bonn},
  year = 	 {1991},
  number = 	 {8568-CS},
}



@incollection {Bodlaender88,
    author = {Bodlaender, Hans L.},
     title = {Dynamic programming on graphs with bounded treewidth},
 booktitle = {Automata, languages and programming (Tampere, 1988)},
    series = LNCS,
    volume = {317},
     pages = {105--118},
 publisher = {Springer},
      year = {1988},
}

@inproceedings{BodlaenderKloks91,
  author    = {H. L. Bodlaender and T. Kloks},
  title     = {Better algorithms for the pathwidth and treewidth of graphs},
  booktitle = {Proceedings of the 18th Internationals Colloquium on Automata, Languages and Programming (ICALP'91)},
  year      = {1991},
  pages     = {544--555},
  volume    = {510},
  series    = LNCS,
  publisher = Springer,
}

@article {Bodlaender93,
    author = {Bodlaender, Hans L.},
     title = {On linear time minor tests with depth-first search},
   journal = JAlg,
    volume = {14},
      year = {1993},
    number = {1},
     pages = {1--23},
}

@article {Bodlaender93b,
    author = {H. L. Bodlaender},
     title = {A Tourist Guide through Treewidth},
   journal = {Acta Cybernetica},
    volume = {11},
      year = {1993},
     pages = {1--21},
}

@article {BodlaenderGilbertHafsteinssonKloks95,
    author = {H. L. Bodlaender and J. R. Gilbert and H. Hafsteinsson and T. Kloks},
     title = {Approximating treewidth, pathwidth, frontsize, and shortest
              elimination tree},
   journal = JAlg,
    volume = {18},
      year = {1995},
    number = {2},
     pages = {238--255},
}

@article {BodlaenderKloksKratsch95,
    author = {H. L. Bodlaender and T. Kloks and D. Kratsch},
     title = {Treewidth and Pathwidth of Permutation Graphs},
   journal = SIAMJDM,
    volume = {8},
      year = {1995},
    number = {4},
     pages = {606--616},
}

@article {Bodlaender96,
    author = {Bodlaender, Hans L.},
     title = {A linear-time algorithm for finding tree-decompositions of
              small treewidth},
   journal = SiamJC,
    volume = {25},
      year = {1996},
    number = {6},
     pages = {1305--1317},
}

@article {BodlaenderKloks96,
    author = {Bodlaender, Hans L. and Kloks, Ton},
     title = {Efficient and constructive algorithms for the pathwidth and
              treewidth of graphs},
   journal = JAlg,
    volume = {21},
      year = {1996},
    number = {2},
     pages = {358--402},
}

@article {Bodlaender98,
    author = {Bodlaender, Hans L.},
     title = {A partial {$k$}-arboretum of graphs with bounded treewidth},
   journal = TCS,
    volume = {209},
      year = {1998},
    number = {1-2},
     pages = {1--45},
}

@inproceedings{Bodlaender05,
  author    = {H. L. Bodlaender},
  title     = {Discovering treewidth},
  booktitle = {Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'05)},
  year      = {2005},
  pages     = {1--16},
  volume    = {3381},
  series    = LNCS,
  publisher = Springer,
}



@inproceedings{BodlaenderFominKosterKratschThilikos06,
  author    = {H. L. Bodlaender and F. V. Fomin and A. M. C. A. Koster and D. Kratsch and D. M. Thilikos},
  title     = {On exact algorithms for treewidth},
  booktitle = {Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06)},
  year      = {2006},
  pages     = {672--683},
  volume    = {4168},
  series    = LNCS,
  publisher = Springer,
}



@incollection {BoliacLozin02,
    author = {Boliac, Rodica and Lozin, Vadim},
     title = {On the clique-width of graphs in hereditary classes},
 booktitle = {Algorithms and computation},
    series = LNCS,
    volume = {2518},
     pages = {44--54},
 publisher = Springer,
      year = {2002},
}


@inproceedings{BondarenkoToniKowalski93,
  author    = {Andrei Bondarenko and
               Francesca Toni and
               Robert A. Kowalski},
  title     = {An Assumption-Based Framework for Non-Monotonic Reasoning.},
  booktitle = {Logic Programming and Non-monotonic Reasoning, 
              Proceedings of the Second International Workshop, 
              Lisbon, Portugal, June 1993},
  year      = {1993},
  pages     = {171--189},
  editor    = {L.M. Pereira and  A. Nerode},
  publisher = {The MIT Press},
}


@book{BondyMurty76,
    author  = {Bondy, J. A. and Murty, U. S. R.},
    title   = {Graph Theory with Applications},
    year    = {1976},
    publisher = {Macmillan},
    address = {London},
}




@InCollection{Bondy95,
  author = 	 {Bondy, J. A.},
  title = 	 {Basic Graph Theory: Paths and Circuits},
  booktitle = 	 {Handbook of Combinatorics},
  pages = 	 {3--110},
  publisher =    Elsevier,
  year = 	 {1995},
  editor = 	 {Graham, R. L. and Gr\"{o}tschel, M. and Lov\'{a}sz, L.},
  volume = 	 {1},
}



@article {BouchitteeKratschMullerTodinca04,
    author = {V. Bouchitt\'{e} and D. Kratsch and H. M\"uller and I. Todinca},
     title = {On treewidth approximations},
   journal = DAM,
    volume = {136},
      year = {2004},
    number = {2-3},
     pages = {183--196},
}



@InProceedings{Boy96,
  author     =    {Thierry Boy de la Tour},
  title      = 	 {Ground Resolution with Group Computations 
                  on Semantic Symmetries}, 
  booktitle  = 	 {Automated Deduction - CADE-13},
  pages      = 	 {478--492},
  year       = 	 {1996},
  editor    = 	 {Michael A. McRobbie and  John K. Slaney},
  volume     = 	 {1104},
  series     = 	 LNCS,
  publisher  =    Springer,
}



@incollection {BoyDemri95,
    author = {Boy de la Tour, Thierry and Demri, St{\'e}phane},
     title = {On the complexity of extending ground resolution with symmetry
              rules},
 booktitle = {IJCAI-95, Vol. 1, 2 (Montreal, PQ, 1995)},
     pages = {289--295},
 publisher = MC,
   address = {San Francisco, CA},
      year = {1995},
}


@article {BrandstadtDraganLeMosca05,
    author = {Brandst{\"a}dt, Andreas and Dragan, Feodor F. and Le,
              Ho{\`a}ng-Oanh and Mosca, Raffaele},
     title = {New graph classes of bounded clique-width},
   journal = TCSys,
    volume = {38},
      year = {2005},
    number = {5},
     pages = {623--645},
}





@Article{BrandstadtEngelfrietLeLozin06,
  author = 	 {Andreas Brandst{\"a}dt and 
                  Joost Engelfriet and Hoang-Oanh Le and  Vadim V. Lozin},
  title = 	 {Clique-Width for 4-Vertex Forbidden Subgraphs},
  journal = 	 TCSys,
  year = 	 {2006},
  volume = 	 {online-first},
  month = 	 FEB,
}

@InProceedings{BuiMoon94,
  author = 	 {Thang Nguyen Bui and Byung Ro Moon},
  title = 	 {A Fast and Stable Hybrid Genetic Algorithm for 
                  the Ratio-Cut Partitioning Problem on Hypergraphs},
  booktitle = 	 {31st Conference on Design Automation (DAC 1994)},
  pages = 	 {664-669},
  year = 	 {1994},
  publisher = {ACM press},
}




@article{Buss91,
    author  = {Buss,  Samuel R.},
    title   = {The undecideability of $k$-provability},
    journal = APAL,
    year    = {1991},
    volume  = {53},
    pages   = {75--102},
}



# CCCC #==================================================

@article{Cai96,
 author = {Leizhen Cai},
 title =  {Fixed-parameter tractability of graph modification 
           problems for hereditary properties},
 journal = IPL,
 volume = {58},
 number = {4},
 year = {1996},
 pages = {171--176},
 }


@article {CaiEtAl93,
    author = {Cai, Liming and Chen, Jianer and Downey, Rodney G. and
              Fellows, Michael R.},
     title = {On the parameterized complexity of short computation and
              factorization},
   journal = AML,
    volume = {36},
      year = {1997},
    number = {4--5},
     pages = {321--337},
}



@article {CaiEtAl93b,
    author = {Cai, Liming and Chen, Jianer and Downey, Rodney G. and
              Fellows, Michael R.},
     title = {Advice classes of parameterized tractability},
  journal = APAL,
    volume = {84},
      year = {1997},
    number = {1},
     pages = {119--138},
}

@InProceedings{CaiHemachandra86,
  author      =	 {J. Cai and L. Hemachandra},
  title       =	 {The boolean hierachy: hardware over {NP}},
  booktitle   =	 {Proceedings of the 1st Structure in 
                  Compexity Theory Conference},
  pages       =	 {105--124},
  year        =	 {1986},
  number      =	 {223},
  series      =	 LNCS,
  publisher   =  Springer,
}

@article{Carbone97,
    author  = {Carbone, Alessandra},
    title   = {Interpolants, cut elimination and flow graphs
     for the propositional calculus},
    journal = APAL,
    year    = {1997},
    volume  = {83},
    pages   = {249--299},
}


@Unpublished{Cesati06,
  author = 	 {Marco Cesati},
  title = 	 {Compendium of Parameterized problems},
  note = 	 {\url{http://bravo.ce.uniroma2.it/home/cesati/research/compendium.pdf}},
  month = 	 SEP,
  year = 	 2006,
}


@Article{Cesati03,
  author = 	 {Marco Cesati},
  title = 	 {The {Turing} way to parameterized complexity },
  journal = 	 JCSS,
  year = 	 {2003},
  volume = 	 {67},
  pages = 	 {654--685},
}

@article{Chandru90,
    author  = {Vajaya Chandru and Collette R. Coullard and 
               Peter L. Hammer and Miguel Monta{\~n}ez and Xiaorong Sun}, 
    title   = {On Renamable {H}orn and Generalized {H}orn Functions},
    journal = AMAI,
    year    = {1990},
    volume  = {1},
    note    = {33--47},
}

@article {ChandruHooker91,
    author = {Chandru, V. and Hooker, J. N.},
     title = {Extended {H}orn sets in propositional logic},
   journal = JACM,
    volume = {38},
      year = {1991},
    number = {1},
     pages = {205--221},
}


@article {ChandruHooker92,
    author = {Chandru, V. and Hooker, J. N.},
     title = {Detecting embedded {H}orn structure in propositional logic},
   journal = IPL,
    volume = {42},
      year = {1992},
    number = {2},
     pages = {109--111},
}


@book{ChangLee,
    author  = {Chang, Chin-Liang and Lee, Richard Char-Tung},
    title   = {Symbolic Logic and Mechanical Theorem Proving},
    year    = {1973},
    publisher = {Academic Press},
    address = {New York},
}


@article {ChekuriChandraRajaraman00,
    author = {Chekuri, Chandra and Rajaraman, Anand},
     title = {Conjunctive query containment revisited},
      note = {Database theory (Delphi, 1997)},
   journal = TCS,
    volume = {239},
      year = {2000},
    number = {2},
     pages = {211--229},
}


@inproceedings{Chen04,
  author    = {Hubie Chen},
  title     = {Quantified Constraint Satisfaction and Bounded Treewidth},
  booktitle = {Proceedings of  ECAI 2004, the 16th Eureopean Conference on 
              Artificial  Intelligence},
  year      = {2004},
  pages     = {161--165},
  publisher = {IOS Press},
}



@InProceedings{ChenDalmau05,
  author = 	 {Hubie Chen and Victor Dalmau},
  title = 	 {Beyond Hypertree Width: Decomposition 
                  Methods Without Decompositions},
  booktitle =    {Proceedings of the 11th International Conference on 
                  Principles and
                  Practice of Constraint Programming (CP 2005), 
                   Sitges, Spain, October 1-5, 2005},
  pages = 	 {167--181},
  year = 	 {2005},
  editor = 	 {Peter Beek},
  volume = 	 {3709},
  series = 	 LNCS,
  publisher =    Springer,
}

@article {ChenKanjJia01,
    author = {Chen, Jianer and Kanj, Iyad A. and Jia, Weijia},
     title = {Vertex cover: further observations and further improvements},
   journal = JAlg,
    volume = {41},
      year = {2001},
    number = {2},
     pages = {280--301},
}

@article {ChenKanj04,
    author = {Chen, Jianer and Kanj, Iyad A.},
     title = {Improved exact algorithms for {M}ax-{S}at},
   journal = DAM,
    volume = {142},
      year = {2004},
    number = {1-3},
     pages = {17--27},
}




@article{ChenKanj05,
 author = {Chen, J. and and Kanj, I.~A.},
 title   = {On approximating minimum vertex cover for graphs 
           with perfect matching},
 journal = TCS,
  volume = {337},
      year = {2005},
    number = {1-3},
     pages = {305--318},
}


@TechReport{ChenKanjXia05,
    author = {Chen, Jianer and Kanj, Iyad A. and Xia, Ge},
     title = {Simplicity is Beauty: Improved Upper Bounds for Vertex Cover},
  institution =  {DePaul University, Chicago IL},
  year = 	 {2005},
  number = 	 {TR05-008},
}







@inproceedings{ChenKanjXia06,
  author    = {Jianer Chen and
               Iyad A. Kanj and
               Ge Xia},
  title     = {Improved Parameterized Upper Bounds for Vertex Cover},
  booktitle = {Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS 2006)},
  year      = {2006},
  pages     = {238--249},
  publisher = Springer,
  series    = LNCS,
  volume    = {4162},
}



@article {ChenKanjXia10,
    author = {Chen, Jianer and Kanj, Iyad A. and Xia, Ge},
     title = {Improved upper bounds for vertex cover},
   journal = TCS,
    volume = {411},
      year = {2010},
    number = {40--42},
     pages = {3736--3756},
}


@article {ChungGrahamFranklShearer86,
    author = {Chung, F. R. K. and Graham, R. L. and Frankl, P. and Shearer,
              J. B.},
     title = {Some intersection theorems for ordered sets and graphs},
   journal = JCombTA,
    volume = {43},
      year = {1986},
    number = {1},
     pages = {23--37},
}



@book {CloteKranakis02,
    author = {Clote, Peter and Kranakis, Evangelos},
     title = {Boolean functions and computation models},
 publisher = Springer,
      year = {2002},
}





@InCollection{CohenJeavons06,
  author = 	 {David Cohen and Peter Jeavons},
  title = 	 {The Complexity of Constraint Languages},
  booktitle = 	 {Handbook of Constraint Programming},
  publisher = {Elsevier},
  year = 	 {2006},
  editor = 	 {Francesca Rossi and Peter van Beek and Toby Walsh},
  volume = 	 {I},
  chapter = 	 {8},
  pages =	 {245--280},
}

@InProceedings{CohenJeavonsGyssens05,
  author = 	 {David Cohen and Peter Jeavons and Marc Gyssens},
  title = 	 {A Unified Theory of Structural Tractability for 
                  Constraint Satisfaction and Spread Cut Decomposition},
  booktitle = {International Joint Conferences on Artificial Intelligence 
                  (IJCAI-05)},
  pages = 	 {72--77},
  year = 	 {2005},
}

@Unpublished{Cook72,
  author = 	 {Cook, Stephen A.},
  title = 	 {An exponential example for analytic tableaux},
  note = 	 {Manuscript},
  year = 	 {1972},
}

@incollection {CookMitchell97,
    author = {Cook, Stephen A. and Mitchell, David G.},
     title = {Finding hard instances of the satisfiability problem: a
              survey},
 booktitle = {Satisfiability problem: theory and applications (Piscataway,
              NJ, 1996)},
     pages = {1--17},
 publisher = AMS,
      year = {1997},
}

@article {CookUrquhart93,
    author = {Cook, Stephen and Urquhart, Alasdair},
     title = {Functional interpretations of feasibly constructive
              arithmetic},
   journal = APAL,
    volume = {63},
      year = {1993},
    number = {2},
     pages = {103--200},
}
@article {CookPitassi90,
    author = {Cook, Stephen and Pitassi, Toniann},
     title = {A feasibly constructive lower bound for resolution proofs},
   journal = IPL,
    volume = {34},
      year = {1990},
    number = {2},
     pages = {81--85},
}
@article {Cook88,
    author = {Cook, Stephen A.},
     title = {Short propositional formulas represent nondeterministic
              computations},
   journal = IPL,
    volume = {26},
      year = {1988},
    number = {5},
     pages = {269--270},
}


@article {CookLuby88,
    author = {Cook, Stephen A. and Luby, Michael},
     title = {A simple parallel algorithm for finding a satisfying truth
              assignment to a $2$-{C}{N}{F} formula},
   journal = IPL,
    volume = {27},
      year = {1988},
    number = {3},
     pages = {141--145},
}

@incollection {Cook75,
    author = {Cook, Stephen A.},
     title = {Feasibly constructive proofs and the propositional calculus
              (preliminary version)},
 booktitle = {Seventh Annual ACM Symposium on Theory of Computing
              (Albuquerque, N.M., 1975)},
     pages = {83--97},
 publisher = ACM,
      year = {1975},
}
@incollection {CookReckhow74,
    author = {Cook, Stephen and Reckhow, Robert},
     title = {On the lengths of proofs in the propositional calculus:
              preliminary version},
 booktitle = {Sixth Annual ACM Symposium on Theory of Computing (Seattle,
              Wash., 1974)},
     pages = {135--148},
 publisher = ACM,
      year = {1974},
}



@InProceedings{Cook71,
    title       = {The Complexity of Theorem-Proving Procedures},
    author      ={Cook, Stephen A.}, 
    pages       ={151--158},
    booktitle   ={Proc. 3rd Annual  Symp. on Theory of Computing}, 
    year        =1971,
    address     ={Shaker Heights, Ohio},
}





@Article{Cook76,
  author = 	 {Stephen A. Cook},
  title = 	 {A short proof of the pigeonhole principle using 
                  extended resolution},
  journal = 	 SigactNews,
  year = 	 {1976},
  volume = 	 {8},
  pages = 	 {28--32},
}

@Article{CookReckhow79,
  author = 	 {Cook, Stephen A. and Reckhow, Robert A.},
  title = 	 {The relative efficiency of propositional proof systems},
  journal = 	 JSL,
  year = 	 1979,
  volume = 	 44,
  number = 	 1,
  month = 	 MAR,
  pages = 	 {36--50},
}


@article {CookWCoullardTuran87,
    author = {Cook, W. and Coullard, C. R. and Tur{\'a}n, Gy.},
     title = {On the complexity of cutting-plane proofs},
   journal = DAM,
    volume = {18},
      year = {1987},
    number = {1},
     pages = {25--38},
}







@Unpublished{CookSeymour02,
  author = 	 {William Cook and Paul Seymour},
  title = 	 {Tour merging via Branch-decomposition},
  note = 	 {Unpublished manuscript, currently available at 
                 http://www.isye.gatech.edu/\noskip 
                 $\sim$wcook/},
  year = 	 {2002},
}





@TechReport{Courcelle87,
  author = 	 {Bruno Courcelle},
  title = 	 {Recognizability and second-order definability 
                  for sets of finite graphs},
  institution =  {Universit\'{e} de Bordeaux},
  year = 	 {1987},
  number = 	 {I-8634},
}




@inproceedings{CourcelleEngelfrietRozenberg90,
  author    = {Bruno Courcelle and
               Joost Engelfriet and
               Grzegorz Rozenberg},
  title     = {Context-free Handle-rewriting Hypergraph Grammars},
  booktitle = {Graph-Grammars and their Application to Computer Science,
               4th International Workshop, Bremen, Germany, March 5--9,
               1990, Proceedings},
  editor    = {Hartmut Ehrig and
               Hans-J{\"o}rg Kreowski and
               Grzegorz Rozenberg},
  year      = {1991},
  pages     = {253--268},
  volume    = {532},
  series    = LNCS,
}


@article {CourcelleEngelfriet95,
    author = {Courcelle, B. and Engelfriet, J.},
     title = {A logical characterization of the sets of hypergraphs defined
              by hyperedge replacement grammars},
   journal = MST,
    volume = {28},
      year = {1995},
    number = {6},
     pages = {515--552},
}


@article {CourcelleEngelfrietRozenberg93,
    author = {Courcelle, Bruno and Engelfriet, Joost and Rozenberg,
              Grzegorz},
     title = {Handle-rewriting hypergraph grammars},
   journal = JCSS,
    volume = {46},
      year = {1993},
    number = {2},
     pages = {218--270},
}

@article {CourcelleOlariu00,
    author = {B. Courcelle and S. Olariu},
     title = {Upper bounds to the clique-width of graphs},
   journal = DAM,
    volume = {101},
      year = {2000},
    number = {1-3},
     pages = {77--114},
}
@article {CourcelleMosbah93,
    author = {Courcelle, B. and Mosbah, M.},
     title = {Monadic second-order evaluations on tree-decomposable graphs},
   journal = TCS,
    volume = {109},
      year = {1993},
    number = {1-2},
     pages = {49--82},
}


@article{CourcelleOum07,
  author = 	 {Bruno Courcelle and {Sang-il} Oum},
  title = 	 {Vertex-minors, monadic second-order logic 
                 and a conjecture by {S}eese},
   journal = JCombTB,
    volume = {97},
      year = {2007},
    number = {1},
     pages = {91--126},
}



@InProceedings{CorneilEtal00,
  author = 	 {Derek G. Corneil and Michel Habib and Jean-Marc Lanlignel 
                 and Bruce A. Reed and Udi Rotics},

  title = 	 {Polynomial Time Recognition of Clique-Width $\leq 3$ 
                 Graphs (Extended Abstract)},
  booktitle =    {Theoretical Informatics, 4th Latin American 
                  Symposium (LATIN 2000)},
  pages = 	 {126--134},
  year = 	 {2000},
  editor = 	 {Gaston H. Gonnet and
                  Daniel Panario and
                  Alfredo Viola},
  volume = 	 {1776},
  series = 	 LNCS,
}


@incollection {CorneilRotics01-old,
    author = {Corneil, Derek G. and Rotics, Udi},
     title = {On the relationship between clique-width and treewidth
              (extended abstract)},
 booktitle = {Graph-theoretic concepts in computer science (WG 2001)},
    series = LNCS,
    volume = {2204},
     pages = {78--90},
 publisher = Springer,
      year = {2001},
}




@Article{CorneilRotics01,
  author = 	 {Corneil, Derek G. and Rotics, Udi},
  title = 	 {On the relationship between clique-width and treewidth},
  journal = 	 SiamJC,
  note = 	 {To appear. An extended abstract appeared in the 
                 Proceedings of  
                 Graph-theoretic Concepts in Computer Science (WG 2001),
                 LNCS 2204, pp. 78-90, Springer, 2001.},
}




@article {CourcelleMakowskyRotics00,
    author = {Courcelle, B. and Makowsky, J. A. and Rotics, U.},
     title = {Linear time solvable optimization problems on graphs of
              bounded clique-width},
   journal = TCSys,
    volume = {33},
      year = {2000},
    number = {2},
     pages = {125--150},
}

@article {CourcelleMakowskyRotics01,
    author = {Courcelle, B. and Makowsky, J. A. and Rotics, U.},
     title = {On the fixed parameter complexity of graph enumeration
              problems definable in monadic second-order logic},
   journal = DAM,
    volume = {108},
      year = {2001},
    number = {1-2},
     pages = {23--52},
}



@Article{CramaEkinHammer97,
  author = 	 {Y. Crama and O. Ekin and P. L. Hammer},
  title = 	 {Variable and term removal from {Boolean} formulae},
  journal = 	 DAM,
  year = 	 {1997},
  volume = 	 {75},
  number = 	 {3},
  pages = 	 {217--230},
}

@TechReport{CreignouHermannKrokhinSalzer05,
  author = 	 {N. Creignou and M. Hermann and  A. Krokhin and G. Salzer},
  title = 	 {Complexity of Clausal Constraints Over Chains},
  institution =  {Ecole Polytechnique},
  month =        JUN,
  year = 	 {2005},
  note = 	 {Technical Report},
}

# DDD #==================================================

@article {DalalEtherington92,
    author = {Dalal, Mukesh and Etherington, David W.},
     title = {A hierarchy of tractable satisfiability problems},
   journal = IPL,
    volume = {44},
      year = {1992},
    number = {4},
     pages = {173--180},
}




@Article{DavydovBuning98,
  author = 	 {Gennady Davydov and Inna Davydova and 
                  Hans {Kleine B\"uning}},
  title = 	 {An efficient algorithm for the minimal unsatisfiability
                  problem for a subclass of {CNF}},
  journal = 	 AMAI,
  year = 	 {1998},
  volume = 	 {23},
  pages = 	 {229--245},
}

@article{DavisPutnam60,
    author  = {M. Davis and H. Putnam},
    title   = {A computing procedure for quantification theory},
    journal = JACM,
    year    = {1960},
    volume  = {7},
    number  = {3},
    pages   = {201--215},
}




@article {DavisLogemannLoveland62,
    author = {Davis, Martin and Logemann, George and Loveland, Donald},
     title = {A machine program for theorem-proving},
   journal = ComACM,
    volume = {5},
      year = {1962},
     pages = {394--397},
}




@InCollection{Dechter92,
  author = 	 {Rina Dechter},
  title = 	 {Constraint Networks},
  booktitle = 	 {Encyclopedia of Artificial Intelligence},
  pages = 	 {276--285},
  publisher =    Wiley,
  year = 	 {1992},
  volume = 	 {1},
  edition = 	 {2nd},

}

@article {DechterPearl89,
    author = {Dechter, Rina and Pearl, Judea},
     title = {Tree clustering for constraint networks},
   journal = AI,
    volume = {38},
      year = {1989},
    number = {3},
     pages = {353--366},
}




@Book{Dechter03,
  author = 	 {Rina Dechter},
  title = 	 {Constraint Processing},
  publisher = 	 MC,
  year = 	 {2003},
}



@InCollection{Dechter06,
  author = 	 {Rina Dechter},
  title = 	 {Tractable Structures for Constraint Satisfaction Problems},
  booktitle = 	 {Handbook of Constraint Programming},
  publisher = {Elsevier},
  year = 	 {2006},
  editor = 	 {Francesca Rossi and Peter van Beek and Toby Walsh},
  volume = 	 {I},
  chapter = 	 {7},
  pages =	 {209--244},
}




@InProceedings{deKleer90,
  author = 	 {Johan {de Kleer}},
  title = 	 {A Comparison of {A}{T}{M}{S} and {C}{S}{P} Techniques},
  booktitle = 	 {11th International Joint Conference on Artificial 
                  Intelligence (IJCAI'89)}, 
  pages = 	 {290--296},
  year = 	 {1989},
  editor = 	 {N. S. Sridharan},
  publisher =    MC,
}

@Book{Diestel00,
  author         = {Reinhard Diestel},
  title          = {Graph Theory},
  publisher      = Springer,
  address        = {New York},
  year           = {2000},
  volume         = {173},
  series         = {Graduate Texts in Mathematics},
  edition        = {2nd},
}

@article {DowlingGallier84,
    author = {Dowling, William F. and Gallier, Jean H.},
     title = {Linear-time algorithms for testing the satisfiability of
              propositional {H}orn formulae},
   journal = JLP,
    volume = {1},
      YEAR = {1984},
    number = {3},
     pages = {267--284},
}

@incollection {DowneyFellowsRegan98,
    author = {Downey, Rodney G. and Fellows, Michael R. and Regan, Kenneth
              W.},
     title = {Descriptive complexity and the {$W$} hierarchy},
 booktitle = {Proof complexity and feasible arithmetics (Rutgers, NJ, 1996)},
    series = {DIMACS Ser. Discrete Math. Theoret. Comput. Sci.},
    volume = {39},
     pages = {119--134},
 publisher = {Amer. Math. Soc.},
   address = {Providence, RI},
      year = {1998},
}




@InProceedings{Downey03,
  author = 	 {Downey, R. G.},
  title = 	 {Parameterized complexity for the skeptic},
  booktitle = {Proc. 18th IEEE Conf. on Computational Complexity 2003},
  pages = 	 {147--168},
  year = 	 {2003},
  note = 	 {invited paper},
}

@article {DowneyFellows95,
    author = {Downey, Rod G. and Fellows, Michael R.},
     title = {Fixed-parameter tractability and completeness. {II}. {O}n
              completeness for {$W[1]$}},
   journal = TCS,
    volume = {141},
      year = {1995},
    number = {1-2},
     pages = {109--131},
}


@book {DowneyFellows99,
    author = {Downey, R. G. and Fellows, M. R.},
     title = {Parameterized Complexity},
     series= {Monographs in Computer Science},
 publisher = Springer,
address ={New York},
      year = {1999},
}






@Unpublished{DowneyFellowsETAL03,
  author = 	 {R. Downey and M. Fellows and  E. Prieto-Rodriguez 
                  and F. Rosamond},
  title = 	 {Fixed-parameter tractability and completeness {V}: 
                  parametric miniatures},
  note = 	 {Manuscript},
  year = 	 {2003},
}

@article {Dubois90,
    author = {Dubois, Olivier},
     title = {On the {$r,s$}-{SAT} satisfiability problem and a conjecture
              of {T}ovey},
   journal = DAM,
    volume = {26},
      year = {1990},
    number = {1},
     pages = {51--60},
}




@Article{DunlopKernighan85,
  author = 	 {Alfred E. Dunlop and Brian W. Kernighan},
  title = 	 {A Procedure for Placement of Standard Cell VLSI Circuits},
  journal = 	 IEEECAD,
  year = 	 {1985},
  volume = 	 {4},
  number = 	 {1},
  pages = 	 {92--98},
}





# EEE #==================================================

@book {EbbinghausFlum99,
    author = {Ebbinghaus, Heinz-Dieter and Flum, J{\"o}rg},
     title = {Finite model theory},
    series = {Perspectives in Mathematical Logic},
   edition = {Second},
 publisher = Springer,
      year = {1999},
}


@article {Edmonds65,
    author = {Edmonds, Jack},
     title = {Paths, trees, and flowers},
   journal = CanJM,
    volume = {17},
      year = {1965},
     pages = {449--467},
}

@inproceedings{EglyTompitsWoltran02,
  author =	{U. Egly and H. Tompits and S. Woltran},
  title =	{On Quantifier Shifting for Quantified {Boolean} Formulas},
  booktitle =	{Proc. SAT'02 Workshop on Theory and Applications of Quantified Boolean Formulas},
  publisher =	{Informal Proceedings},
  pages =	{48--61},
  year =	{2002}
}

@article {EiterGottlob00,
    author = {Eiter, Thomas and Gottlob, Georg},
     title = {Complexity results for some eigenvector problems},
   journal = IJCM,
    volume = {76},
      year = {2000},
    number = {1},
     pages = {59--74},
}


@article {EllisSudboroughTurner94,
    author = {Ellis, J. A. and Sudborough, I. H. and Turner, J. S.},
     title = {The vertex separation and search number of a graph},
   journal = InfComp,
     volume = {113},
      year = {1994},
    number = {1},
     pages = {50--79},
}



@book{Emden96,
  author = 	 {Thomas Emden-Weinert and Stefan Hougardy and  Bernd Kreuter 
                  and Hans J\"{u}rgen Pr\"{o}mel and  Angelika Steger},
  title = 	 {Einf\"uhrung in Graphen und Algorithmen },
  publisher = 	 {Humbold Universit\"{a}t zu Berlin, 
                  Institut f\"{u}r Informatik},
  address = 	 {http://www.\-informatik\-.hu-berlin.de/\-Institut/\-struktur/\-algorithmen/ga/},
  year = 	 1996,
  month = 	 Sep,
}


@article {EspelageGurskiWanke03,
    author = {Espelage, Wolfgang and Gurski, Frank and Wanke, Egon},
     title = {Deciding clique-width for graphs of bounded tree-width},
   journal = JGAA,
    volume = {7},
      year = {2003},
    number = {2},
     pages = {141--180},
}



@article {EvenItaiShamir76,
    author = {Even, S. and Itai, A. and Shamir, A.},
     title = {On the complexity of timetable and multicommodity flow
              problems},
   journal = SiamJC,
    volume = {5},
      year = {1976},
    number = {4},
     pages = {691--703},
   mrclass = {90B10}
}

# FFF #==================================================


@article {Fagin83,
    author = {Fagin, Ronald},
     title = {Degrees of acyclicity for hypergraphs and relational database
              schemes},
   journal = JACM,
    volume = {30},
      year = {1983},
    number = {3},
     pages = {514--550},
}

@article {FederVardi99,
    author = {Feder, Tom{\'a}s and Vardi, Moshe Y.},
     title = {The computational structure of monotone monadic {SNP} and
              constraint satisfaction: a study through {D}atalog and group
              theory},
   journal = SiamJC,
    volume = {28},
      year = {1999},
    number = {1},
     pages = {57--104},
}


@InProceedings{Fellows03,
  author = 	 {Michael R. Fellows},
  title = 	 {Blow-Ups, Win/Win's, and Crown Rules: 
                  Some New Directions in {FPT}},
  booktitle = 	 {Graph-Theoretic Concepts in Computer Science (WG 2003)},
  pages = 	 {1--12},
  year = 	 {2003},
  editor = 	 {H. L. Bodlaender},
  volume = 	 {2880},
  series = 	 LNCS,
  publisher =    Springer,
}




@TechReport{Fernau05,
  author = 	 {Henning Fernau},
  title = 	 {Parameterized Algorithmics: A Graph-theoretic Approach},
  institution = 	 {Universt{\"a}t. T{\"u}bingen},
  year = 	 {2005},
  note = 	 {Habilitation thesis},
}

@book{FerranteRackoff79,
    author = {Ferrante, Jeanne and Rackoff, Charles W.},
     title = {The computational complexity of logical theories},
 publisher = Springer,
      year = {1979},
}






@Article{FischerMakowskyRavve06,
  author =	 {E. Fischer and J.~A. Makowsky and E.~R. Ravve},
  title =	 {Counting truth assignments of formulas of bounded
                  tree-width or clique-width.},
  journal =	 DAM,
  volume =	 {156},
  year =	 {2008},
  number =	 {4},
  pages =	 {511--529},
}

@article{Fleischner76a,
    author  = {Herbert Fleischner},
    title   = {Eine gemeinsame {Basis} f{\"u}r die 
               {Theorie} der {Eulerschen} {Graphen}
               und den {Satz} von {Petersen}},
    journal = {Monatsh. Math.},
    year    = {1976},
    volume  = {81},
    pages   = {267--278}
}

@article{Fleischner77,
    author  = {Herbert Fleischner},
    title   = {On the Equivalence of {Mealy}-Type and {Moore}-Type Automata
      and a Relation between Reducibility and {Moore}-Reducibility},
    journal = {J. of Computer and System Sciences},
    year    = 1977,
    month   = feb,
    volume  = 14,
    number  = 1,
    pages   = {1--16}
}

@article{FleischnerJ87,
    author  = {Herbert Fleischner and Bill Jackson},
    title   = {Compatible Path-Cycle-Decompositions of Plane Graphs},
    journal = JCombTB,
    year    = {1987},
    volume  = {42},
    pages   = {94--121}
}

@inproceedings{Fleischner88,
    author  = {Herbert Fleischner},
    title   = {Some Blood, Sweat, but no Tears in {Eulerian} Graph Theory},
    booktitle = {Proc. of the 250th Ann. Conf. on Graph Theory},
    series  = {Congr. Numer.},
    volume  = {63},
    year    = {1988},
    pages   = {8--48}
}








@Article{FleischnerFrank88,
  author = 	 {Herbert Fleischner and Andr\'{a}s Frank},
  title = 	 {On Circuit Decomposition of Planar Eulerian Graphs},
  journal = 	 JCombTB,
  year = 	 {1990},
  volume = 	 {50},
  pages = 	 {245--253},
}

@book{Fleischner90,
    author  = {Herbert Fleischner},
    title   = {{Eulerian} Graphs and Related Topics, Part 1, Volume 1},
    year    = {1990},
    publisher = Elsevier,
    address = {Amsterdam},
    series  = {Annals of Discrete Mathematics 45}
}

@incollection{FleischnerJ90,
    author  = {Herbert Fleischner and Bill Jackson},
    title   = {Compatible {Euler} Tours in {Eulerian} Digraphs },
    booktitle = {Cycles and Rays},
    year    = {1990},
    editor  = {Hahn, Ge\v{n}a and Sabidussi, Gert and R. Woodrow},
    publisher = Kluwer,
    pages   = {95--100}
}



@book{Fleischner91,
    author  = {Herbert Fleischner},
    title   = {{Eulerian} Graphs and Related Topics, Part 1, Volume 2},
    year    = {1991},
    publisher = Elsevier,
    address = {Amsterdam},
    series  = {Annals of Discrete Mathematics 50}
}


@article{Fleischner92,
    author  = {Herbert Fleischner},
    title   = {Spanning {Eulerian} Subgraphs, the {Splitting Lemma},
       and {Petersen's} {Theorem}},
    journal = DM,
    year    = {1992},
    volume  = {101},
    pages   = {33--37}
}

@article{FleischnerA95,
    author  = {Herbert Fleischner and L. D. Andersen},
    title   = {The {NP}-Completeness of Finding {A}-trails in
      {Eulerian} Graphs and of finding Spanning Trees in Hypergraphs},
    journal = DAM,
    year    = {1995},
    volume  = {59},
    pages   = {203--214}
}



 
@Unpublished{FleischnerPC00,
  author = 	 {Herbert Fleischner},
  title = 	 {Personal communication},
}

@TechReport{FleischnerSzeider00,
  author = 	 {Herbert Fleischner and Stefan Szeider},
  title = 	 {Polynomial-Time Recognition of  Minimal Unsatisfiable
                  Formulas with  Fixed Clause-Variable Difference},
  institution =  ECCC,
  number = 	 {TR00--049},
  year = 	 {2000},
}






@Misc{Fleischner01,
  author = 	 {Herbert Fleischner},
  title = 	 {Jahresbericht 2000 des 
                  {I}nstituts f\"{u}r {D}iskrete {M}athematik}, 
  month = 	 MAR,
  year = 	 {2001},
  note = 	 {Austrian Academy of Sciences},
}

@TechReport{FleischnerFoldesSzeider01,
  author = 	 {Herbert Fleischner and 
                  Stephan F\"{o}ldes and Stefan Szeider},
  title = 	 {Remarks on the Concept of Robust Algorithm},
  institution =  {\emph{Rutgers Center for Operations Research} (RUTCOR)},
  year = 	 {2001},
  number = 	 {RRR 26-2001},
  month = 	 APR,
}


@Unpublished{Fleischner01a,
  author = 	 {Herbert Fleischner},
  title = 	 {A {T}utte-Type Characterization of 1-extendable Graphs},
  note = 	 {Preprint},
}





@TechReport{FlityRenaud94,
  author = 	 {T. Flity and G. Reynauld},
  title = 	 {Sizes of minimally unsatisfiable conjunctive normal forms},
  institution =  {Facult\'{e} de Sciences de Luminy, 
                  Dpt. Math\'{e}matique-Informatique}, 
  year = 	 {1994},
}





@Article{FlumGrohe04,
  author = 	 {J\"{o}rg Flum and Martin Grohe},
  title = 	 {Parameterized Complexity and Subexponential Time},
  journal = 	 BEATCS,
  volume =       {84},
  pages =        {71--100},
  year =         {2004},
}



@article {FlumGrohe04b,
    author = {Flum, J{\"o}rg and Grohe, Martin},
     title = {The parameterized complexity of counting problems},
   JOURNAL = SiamJC,
    volume = {33},
      year = {2004},
    number = {4},
     pages = {892--922},
}



@Article{FlumGrohe05,
  author = 	 {J\"{o}rg Flum and Martin Grohe},
  title = 	 {Model-checking problems as a basis for 
                  parameterized intractability},
  journal = 	 LMCS,
  volume =       {1},
  number =       {1:2},
  pages =        {1--36},
  year =         {2005},
}




@Book{FlumGrohe06,
  author = 	 {J\"{o}rg Flum and Martin Grohe},
  title = 	 {Parameterized Complexity Theory},
  publisher = 	 Springer,
  year = 	 {2006},
  volume = 	 {XIV},
  address =      {Berlin},
  series = 	 {Texts in Theoretical Computer Science. An EATCS Series},
}

@InProceedings{FominKratschTodinca04,
  author = 	 {F. V. Fomin and D. Kratsch and I. Todinca},
  title = 	 {Exact (exponential) algorithms for treewidth and minimum fill-in},
  booktitle = 	 {Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04)},
  pages = 	 {568--580},
  year = 	 {2004},
  volume = 	 {3142},
  series = 	 LNCS,
  publisher =    Springer
}

@article {FrancoEtal99,
    author = {Franco, John and Goldsmith, Judy and Schlipf, John and
              Speckenmeyer, Ewald and Swaminathan, R. P.},
     title = {An algorithm for the class of pure implicational formulas},
   journal = DAM,
    volume = {96/97},
      year = {1999},
     pages = {89--106},
}



@article{FrancoVanGelder03,
  author = 	 {John Franco and Allen {Van Gelder}},
  title = 	 {A Perspective on Certain Polynomial Time Solvable 
                  Classes of Satisfiability},
  journal =      DAM,
  volume =       125,
  year =         2003,
  pages =        {177--214},
}




@article {Freuder82,
    author = {Freuder, Eugene C.},
     title = {A sufficient condition for backtrack-bounded search},
   journal = JACM,
    volume = {29},
      year = {1982},
    number = {1},
     pages = {24--32},
}


@article {Freuder85,
    author = {Freuder, Eugene C.},
     title = {A sufficient condition for backtrack-bounded search},
   journal = JACM,
    volume = {32},
      year = {1985},
    number = {4},
     pages = {755--761},
}





@article{FrickGrohe01,
 author = {Markus Frick and Martin Grohe},
 title = {Deciding first-order properties of locally 
          tree-decomposable structures},
 journal = JACM,
 volume = {48},
 number = {6},
 year = {2001},
 pages = {1184--1206},
 }

@InProceedings{FrischPeugniez01,
  author = 	 {Alan M. Frisch and Timothy J. Peugniez},
  title = 	 {Solving Non-Boolean Satisfiability Problems with 
                  Stochastic Local Search},
  booktitle = 	 {17th International Joint Conference
                  on Artificial Intelligence (IJCAI 2001)},
  pages = 	 {282--290},
  year = 	 {2001},
  editor = 	 {Bernhard Nebel},
  publisher =    MC,
}


@incollection {FominHeggernesTelle03,
    author = {Fomin, Fedor V. and Heggernes, Pinar and Telle, Jan Arne},
     title = {Graph searching, elimination trees, and a generalization of
              bandwidth},
 booktitle = {Fundamentals of computation theory},
    series = LNCS,
    volume = {2751},
     pages = {73--85},
 publisher = Springer,
      year = {2003},
}


@article {FuUrquhart96,
    author = {Fu, Xudong and Urquhart, Alasdair},
     title = {Simplified lower bounds for propositional proofs},
   journal = NDJFL,
    volume = {37},
      year = {1996},
    number = {4},
     pages = {523--544},
}


# GGG #==================================================




@Article{GabowEtAl76,
  author = 	 {Harold N. Gabow and 
                  Shachindra N. Maheshwari and Leon J. Osterweil},
  title = 	 {On Two Problems in the Generation of Program Test Paths},
  journal = 	 IEEESE,
  year = 	 {1976},
  volume = 	 {SE-2},
  number = 	 {3},
  pages = 	 {227--231}
}

@article{Galil77,
    author  = {Zvi Galil},
    title   = {On the Complexity of Regular Resolution and the
        {Davis} and {Putnam} Procedure},
    journal = TCS,
    year    = {1977},
    volume  = {4},
    pages   = {23--46}
}






@InProceedings{Galil83,
  author = 	 {Zvi Galil},
  title = 	 {Efficient algorithms for finding maximal matching in graphs},
  booktitle = 	 {CAAP '83 (L'Aquila, 1983)},
  pages = 	 {90--113},
  year = 	 {1983},
  volume = 	 {159},
  series = 	 LNCS,
  publisher =    Springer,
}



@article {GalloScutella88,
    author = {Gallo, Giorgio and Scutell{\`a}, Maria Grazia},
     title = {Polynomially solvable satisfiability problems},
   journal = IPL,
    volume = {29},
      year = {1988},
    number = {5},
     pages = {221--227},
}

@article{Gallo,
    author  = {Gallo, Giorgio and  Longo, Giustino and Pallotino, 
               Stefano and Nguyen, Sang},
    title   = {Directed hypergraphs and applications},
    journal = {Discrete Applied Mathematics},
    year    = {1993},
    volume  = {42},
    pages   = {177--201}
}


@TechReport{GanzowGottlobMusliuSamer05,
    author = {Tobias Ganzow and Georg Gottlob and 
              Nysret Musliu and Marko Samer},
     title = {A {CSP} Hypergraph Library},
  institution =  {Database and Artificial Intelligence Group, 
               Vienna University of Technology},
  year = 	 {2005},
  number = 	 {DBAI-TR-2005-50},
}

@article {GareyJohnsonStockmeyer76,
    author = {Garey, M. R. and Johnson, D. S. and Stockmeyer, L.},
     title = {Some simplified {NP}-complete graph problems},
   journal = TCS,
    volume = {1},
      year = {1976},
    number = {3},
     pages = {237--267},
}


@Book{GareyJohnson79,
  author = 	 {Michael R. Garey and David R. Johnson},
  title = 	 {Computers and Intractability},
  publisher = 	 Freeman,
address =   {San Francisco},
  year = 	 {1979}
}





@TechReport{VanGelder95,
  author = 	 {Allen {Van Gelder}},
  title = 	 {Linear Time Unit Resolution for Propositional 
			  Formulas--in Prolog, yet},
  institution =  {University of California, Santa Cruz},
  year = 	 {1995},
  number = 	 {ucsc-crl-95-25},
}



@TechReport{Gent01,
  author = 	 {Ian P. Gent},
  title = 	 {An Optimal SAT Encoding of 
                  Arc Consistency in Binary {C}{S}{P}'s},
  institution =  {CP2001 Post Conference Workshop
                 Modelling and Problem Formulation (Formul'01)},
  year = 	 {2001},
}


@inproceedings{Gent02,
    author    =   {Ian P. Gent},
    title     =   {Arc Consistency in {SAT}},
    booktitle =   {15th European Conference on Artificial 
                    Intelligence (ECAI 2002)},
    publisher =    {IOS Press},
    year =         {2002},
    editor   =      {F. {van Harmelen}},
    pages =         {121--125}
}


@inproceedings{GentRowley03,
     
        year   = {2003},

        booktitle = {Proc. 2nd International Workshop on 
                    Modelling and Reformulating Constraint 
                    Satisfaction Problems},
        pages = {78--93},
}

@TechReport{GentRowley03,
   author = {I.P. Gent and A.G.D. Rowley},
   title  = {Encoding {Connect-4} using Quantified Boolean Formulae},
  institution =  {University of St. Andrews, Fife, Scotland,UK},
  year = 	 {2003},
  month = 	 JUL,
}


@article{Gentzen1,
    author  = {Gentzen, Gerhard},
    title   = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
    journal = {Mathematische Zeitschrift},
    year    = {1935},
    volume  = {39},
    pages   = {176--210, 405--431},
    note    = {English translation in \cite{Szabo}}
}






@Book{Gibbons85,
  author = 	 {Alan Gibbons},
  title = 	 {Algorithmic Graph Theory},
  publisher = 	 CamUP,
  year = 	 {1983},
}

@article{Girard87,
    author  = {Girard, J.-Y.},
    title   = {Linear Logic},
    journal = TCS,
    year    = {1987},
    volume  = {50},
    pages   = {1--102}
}


@incollection {Girard94,
    author = {Girard, Jean-Yves},
     title = {Linear logic: a survey},
 booktitle = {Logic and algebra of specification (Marktoberdorf, 1991)},
    series = {NATO Adv. Sci. Inst. Ser. F Comput. Systems Sci.},
    volume = {94},
     pages = {63--112},
 publisher = Springer,
      year = {1993},
}


@incollection {GliksonMakowsky03,
    author = {Glikson, Alexander and Makowsky, Johann A.},
     title = {N{CE} graph grammars and clique-width},
 booktitle = {Graph-theoretic concepts in computer science},
    series = LNCS,
    volume = {2880},
     pages = {237--248},
 publisher = Springer,
      year = {2003},
}



@Unpublished{Goldstern00,
  author = 	 {Martin Goldstern},
  title = 	 {Private communication},
}



@article {GoldwasserMicaliRackoff89,
    author = {Goldwasser, Shafi and Micali, Silvio and Rackoff, Charles},
     title = {The knowledge complexity of interactive proof systems},
   journal = SiamJC,
    volume = {18},
      year = {1989},
    number = {1},
     pages = {186--208},
}



@article {GolumbicRotics00,
    author = {Golumbic, Martin Charles and Rotics, Udi},
     title = {On the clique-width of some perfect graph classes},
      note = {Selected papers from the Workshop on Graph-Theoretical Aspects of
              Computer Science (WG 99), Part 1 (Ascona)},
   journal = IJFCS,
    volume = {11},
      year = {2000},
    number = {3},
     pages = {423--443},
}



@InProceedings{GottlobKoch02,
  author = 	 {Georg Gottlob and Christoph Koch},
  title = 	 {Monadic Queries over Tree-Structured Data},
  booktitle = {Proceedings of the 17th Annual IEEE 
                  Symposium on Logic in Computer Science (LICS 2002)},
  pages = 	 {189--202},
  year = 	 {2002},
}


@inproceedings{GottlobGrecoScarcello05,
  author    = {Georg Gottlob and
               Gianluigi Greco and
               Francesco Scarcello},
  title     = {The Complexity of Quantified Constraint Satisfaction Problems
               under Structural Restrictions},
  booktitle = {Proceedings of IJCAI 2005, the Nineteenth International Joint
               Conference on Artificial Intelligence},
  year      = {2005},
  publisher = {PBC},
  pages     = {150--155},
}


@article {GottlobScarcelloSideri02,
    author = {Gottlob, Georg and Scarcello, Francesco and Sideri, Martha},
     title = {Fixed-parameter complexity in {AI} and nonmonotonic reasoning},
   journal = AI,
    volume = {138},
      year = {2002},
    number = {1-2},
     pages = {55--86},
}

@article {GottlobLeoneScarcello02b,
    author = {G. Gottlob and N. Leone and F. Scarcello},
     title = {Hypertree Decompositions and Tractable Queries},
   journal = JCSS,
    volume = {64},
      year = {2002},
    number = {3},
     pages = {579--627},
}



@InProceedings{GottlobHutleWotawa02,
  author = 	 {Georg Gottlob and Martin Hutle and Franz Wotawa},
  title = 	 {Combining hypertree, bicomp, and hinge decomposition},
  booktitle = 	 {15th European Conference on Artificial Intelligence 
                  (ECAI 02)},
  year = 	 {2002},
  address = 	 {Lyon, France},
  month = 	 {July},
}

@Unpublished{GottlobKolaitisSchwentick,
  author = 	 {Georg Gottlob and Phokion G. Kolaitis and Thomas Schwentick},
  title = 	 {Existential Second-Order Logic over Graphs: 
                  Charting the Tractability Frontier},
  note = 	 {\emph{J. of the ACM}, to appear},
}



@inproceedings{GottlobLeoneScarcello99,
  author    = {Georg Gottlob and
               Nicola Leone and
               Francesco Scarcello},
  title     = {On Tractable Queries and Constraints.},
  booktitle = {Database and Expert Systems Applications, 10th International
               Conference, DEXA '99, Florence, Italy, August 30 - September
               3, 1999, Proceedings},
  series    = LNCS,
  volume    = {1677},
  year      = {1999},
  pages     = {1--15},
}


@article {GottlobLeoneScarcello00,
    author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
     title = {A comparison of structural {CSP} decomposition methods},
   journal = AI,
    volume = {124},
      year = {2000},
    number = {2},
     pages = {243--282},
}




@article {GottlobLeoneScarcello01,
    author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
     title = {The complexity of acyclic conjunctive queries},
   journal = JACM,
    volume = {48},
      year = {2001},
    number = {3},
     pages = {431--498},
}


@InProceedings{GottlobPichler01,
  author = 	 {Georg Gottlob and Reinhard Pichler},
  title = 	 {Hypergraphs in Model Checking: Acyclicity and  
                  Hypertree-Width versus   Clique-Width},
  booktitle = 	 {28th International Colloquium on Automata, 
                 Languages and Programming (ICALP01)}, 
  pages = 	 {708--719},
  year = 	 {2001},
  editor = 	 {Fernando Orejas and Paul G. Spirakis and Jan van Leeuwen},
  volume = 	 {2076},
  series = 	 LNCS,
}

@article {GottlobPichler04,
    author = {Gottlob, Georg and Pichler, Reinhard},
     title = {Hypergraphs in model checking: acyclicity and hypertree-width
              versus clique-width},
   journal = SiamJC,
    volume = {33},
      year = {2004},
    number = {2},
     pages = {351--378},
}

@incollection {GottlobLeoneScarcello01a,
    author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
     title = {Hypertree decompositions: a survey},
 booktitle = {Mathematical foundations of computer science, 2001
              (Mari\'ansk\'e L\'azn\u e)},
    series = LNCS,
    volume = {2136},
     pages = {37--57},
 publisher = {Springer},
      year = {2001},
}





@article {GottlobLeoneScarcello02,
    author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
     title = {Hypertree decompositions and tractable queries},
   journal = JCSS,
    volume = {64},
      year = {2002},
    number = {3},
     pages = {579--627},
}


@article {GottlobLeoneScarcello03,
    author = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
     title = {Robbers, marshals, and guards: game theoretic and 
              logical characterizations of hypertree width},
   journal = JCSS,
    volume = {66},
      year = {2003},
    number = {4},
     pages = {775--808},
}


     
@InProceedings{GottlobGroheMusliuSamerScarcello05,
  author = 	 {Georg Gottlob and  Martin Grohe and Nysret Musliu 
                  and Marko Samer and Francesco Scarcello},
  title = 	 {Hypertree Decompositions: Structure, Algorithms,
                  and Applications},
  booktitle = {Proceedings of the 31st International Workshop on 
                  Graph-Theoretic Concepts in Computer Science (WG'05)},
  pages = 	 {1--15},
  year = 	 {2005},
  editor = 	 {Dieter Kratsch},
  volume = 	 {3787},
  series = 	 LNCS,
  publisher =   Springer,
}






@Article{GrammEtal03,
  author = 	 {Gramm},
  title = 	 {??},
  journal = 	 {??},
  year = 	 {??},
}



@article {GrammGuoHueffnerNiedermeier05,
    author = {Gramm, Jens and Guo, Jiong and H{\"u}ffner, Falk and
              Niedermeier, Rolf},
     title = {Graph-modeled data clustering: fixed-parameter algorithms for
              clique generation},
   journal = TCSys,
    volume = {38},
      year = {2005},
    number = {4},
     pages = {373--392},
}




@inproceedings {GroheSchwentickSegoufin01,
    author = {Grohe, Martin and Schwentick, Thomas and Segoufin, Luc},
     title = {When is the evaluation of conjunctive queries tractable?},
 booktitle = {Proceedings of the Thirty-Third Annual ACM Symposium on Theory
              of Computing},
     pages = {657--666},
 publisher = {ACM},
   address = {New York},
      year = {2001},
}




@Article{Grohe07,
  author = 	 {Martin Grohe},
  title = 	 {The complexity of homomorphism and constraint satisfaction problems seen from the other side},
  journal = 	 JACM,
  year = 	 {2007},
  volume = 	 {54},
  number = 	 {1},
  OPTpages = 	 {},
}



@article{Grohe02,
 author = {Martin Grohe},
 title = {Parameterized complexity for the database theorist},
 journal = {SIGMOD Rec.},
 volume = {31},
 number = {4},
 year = {2002},
 pages = {86--96},
 }






@InProceedings{GroheMarx06,
  author = 	 {Martin Grohe and D\'{a}niel Marx},
  title = 	 {Constraint Solving via Fractional Edge Covers},
  booktitle =    {Proceedings of the of the 17th Annual ACM-SIAM 
                  Symposium on Discrete Algorithms (SODA 2006)},
  year = 	 {2006},
  publisher = {ACM Press},
  pages =      {289--298},
}

@Article{GrossmanHaggkvist81,
  author = 	 {Jerrold W. Grossman and Roland H\"{a}ggkvist},
  title = 	 {Alternating Cycles in Edge-Partitioned Graphs},
  journal = 	 JCombTB,
  year = 	 {1983},
  volume = 	 {34},
  number =        {1},
  pages = 	 {77--81},
}



@incollection {GuPurdomPaulFrancoWah97,
    author = {Gu, Jun and Purdom, Paul W. and Franco, John and Wah, Benjamin
              W.},
     title = {Algorithms for the satisfiability ({S}{A}{T}) problem: a
              survey},
 booktitle = {Satisfiability problem: theory and applications (Piscataway,
              NJ, 1996)},
     pages = {19--151},
 publisher = AMS,
      year = {1997},
}



@InProceedings{GuoHuffnerNiedermeier04,
  author = 	 {Jiong Guo and Falk H\"{u}ffner and Rolf Niedermeier},
  title = 	 {A Structural View on Parameterizing Problems: 
                  Distance from Triviality},
  booktitle =    {1st International Workshop on Parameterized and 
                  Exact Computation (IWPEC 2004)},
  pages = 	 {162--173},
  year = 	 {2004},
  editor = 	 {Rod Downey and Michael Fellows and Frank Dehne},
  volume = 	 {3162},
  series = 	 {Lecture Notes in Computer Science},
  publisher =    {Springer},
}


@inproceedings{GuoGrammHueffnerNiedermeierWernicke05,
  author    = {Jiong Guo and
               Jens Gramm and
               Falk H{\"u}ffner and
               Rolf Niedermeier and
               Sebastian Wernicke},
  title     = {Improved Fixed-Parameter Algorithms for Two Feedback Set
               Problems.},
  booktitle = {Algorithms and Data Structures, 9th International Workshop,
               WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
  year      = {2005},
  pages     = {158-168},
  series    = LNCS,
  volume    = {3608},
  editor    = {Frank K. H. A. Dehne and
               Alejandro L{\'o}pez-Ortiz and
               J{\"o}rg-R{\"u}diger Sack},
}



@Article{GuoNiedermeier07,
  author = 	 {Jiong Guo and Rolf Niedermeier},
  title = 	 {Invitation to data reduction and problem kernelization},
  journal = 	 {ACM SIGACT News},
  year = 	 {2007},
  volume = 	 {38},
  number = 	 {2},
  pages = 	 {31--45},
  month = 	 MAR,
}


@article {GurskiWanke06,
    author = {Gurski, Frank and Wanke, Egon},
     title = {Vertex disjoint paths on clique-width bounded graphs},
   journal = TCS,
    volume = {359},
      year = {2006},
    number = {1-3},
     pages = {188--199},
}

 



@incollection {GurskiWanke05,
    author = {Gurski, Frank and Wanke, Egon},
     title = {Minimizing {NLC}-width is {NP}-complete (extended abstract)},
 booktitle = {Graph-theoretic concepts in computer science},
    series = LNCS,
    volume = {3787},
     pages = {69--80},
 publisher = Springer,
      year = {2005},
}
	


@Article{GurskiWanke05b,
  author = 	 {Frank Gurski and Egon Wanke},
  title = 	 {On the relationship between {NLC}-width and 
                  linear {NLC}-width},
  journal = 	 TCS,
 volume = {347},
      year = {2005},
    number = {1-2},
     pages = {76--89},
}



@article {GyssensJeavonsCohen94,
    author = {Gyssens, Marc and Jeavons, Peter G. and Cohen, David A.},
     title = {Decomposing constraint satisfaction problems using database
              techniques},
   journal = AI,
    volume = {66},
      year = {1994},
    number = {1},
     pages = {57--89},
}

@InProceedings{GyssensParedaens84,
  author = 	 {Marc Gyssens and Jan Paredaens},
  title = 	 {A Decomposition Methodology for Cyclic Databases},
  booktitle = 	 {Advances in Data Base Theory},
  pages = 	 {85-122},
  year = 	 {1984},
  editor = 	 {Herv\'{e} Gallaire and Jean-Marie Nicolas and Jack Minker},
  volume = 	 {2},
  publisher =    {Plemum Press, New York},
}



# HHH #==================================================


@inproceedings{HahnTardif97,
    author  = {Hahn, Ge\v{n}a and Tardif, Claude},
    title   = {Graph homomorphisms: structure and symmetry},
    booktitle = {Graph Symmetry},
    year    = {1997},
    editor  = {Hahn, Ge\v{n}a and Sabidussi, Gert},
    publisher = Kluwer,
    pages   = {107--166}
}




@article {Hajos61,
    author = {Haj{\'o}s, G.},
     title = {\"{U}ber eine Konstruction nicht $n$-f\"{a}rbbarer Graphen},
   journal = {Wiss. Zeitschr. Martin Luther Univ. Halle-Wittenberg},
    volume = {A 10},
      year = {1961},
     pages = {116--117},
}



@Article{Haken85,
  author = 	 {Armin Haken},
  title = 	 {The intractability of resolution},
  journal = 	 TCS,
  year = 	 {1985},
  volume = 	 {39},
  pages = 	 {297--308},
}







@Article{Hall35,
  author = 	 {Phiip Hall},
  title = 	 {On representatives of subsets},
  journal = 	 JLMS,
  year = 	 {1935},
  volume = 	 10,
  pages = 	 {26--30},
}



@InProceedings{HarveyGhose03,
  author = 	 {Peter Harvey and Aditya Ghose},
  title = 	 {Reducing Redundancy in the Hypertree Decomposition Scheme},
  booktitle = 	 {15th IEEE International Conference on Tools with 
                  Artificial Intelligence},
  note = 	 {To appear},
}


@article{Hebrard94,
    author  = {Jean-Jacques H{\'e}brard},
    title   = {A linear algorithm for renaming a set of clauses 
               as a {Horn} set},
    journal = TCS,
    year    = {1994},
    month   = feb,
    volume  = {124},
    number  = {2},
    pages   = {343--350}
}


@article{Hebrard95,
    author  = {Jean-Jacques H{\'e}brard},
    title   = {Unique {Horn} renaming and {Unique 2-Satisfiability}},
    journal = IPL,
    year    = 1995,
    month   = may,
    volume  = 54,
    number  = 4,
    pages   = {235--239}
}




@article {HellNesetril90,
    author = {Hell, Pavol and Ne{\v{s}}et{\v{r}}il, Jaroslav},
     title = {On the complexity of {$H$}-coloring},
   journal = JCombB,
    volume = {48},
      year = {1990},
    number = {1},
     pages = {92--110},
}




@article {HellNesetril92,
    author = {Hell, Pavol and Ne{\v{s}}et{\v{r}}il, Jaroslav},
     title = {The core of a graph},
   journal = DM,
    volume = {109},
      year = {1992},
    number = {1-3},
     pages = {117--126},
}





@inproceedings{Hell00,
    author = {Pavol Hell},
    title = {Graph Packings},
    booktitle = {Proceedings for the 6th International 
    Conference on Graph Theory},
    series = ENDM,
    volume = {5},
    publisher = Elsevier,
    editor = {Irena Rusu},
    year = 2000
}


@article {Heusch99,
    author = {Heusch, Peter},
     title = {The complexity of the falsifiability problem for pure
              implicational formulas},
   JOURNAL = DAM,
    volume = {96/97},
      year = {1999},
     pages = {127--138},
}



@article{HeuschPorschenSpeckenmeyer03,
 author    = {Peter Heusch and Stefan Porschen and Ewald Speckenmeyer},
 title     =    {Improving a fixed parameter tractability 
                 time bound for the shadow problem},
 journal   = JCSS,
 volume    = {67},
 number    = {4},
 year      = {2003},
 pages     = {772--788},
 }


@InProceedings{HoffmannGomesSelman06,
  author = 	 {Joerg Hoffmann and Carla Gomes and Bart Selman},
  title = 	 {Structure and Problem Hardness: Goal Asymmetry and 
                 {DPLL} Proofs in {SAT}-Based Planning},
  booktitle = {{ICAPS 06} Proceedings of International Conference on 
                Automated Planning and Scheduling,  Cumbria, UK, June 2006},
}





@Article{HopcroftKarp73,
  author = 	 {Hopcroft, John E. and Karp, Richard M.},
  title = 	 {An $n^{5/2}$ algorithm for maximum matchings in 
                  bipartite graphs.}, 
  journal = 	 JComput,
  year = 	 {1973},
  volume = 	 {2},
  pages = 	 {225--231},
}






@article{HortonSpencer,
    author  = {Horton, J. D. and Spencer, Bruce},
    title   = {Clause Trees: A Tool for Understanding and Implementing
     Resolution in Automated Reasoning},
    journal = AI,
    year    = {1997},
    volume  = {92},
    pages   = {25--89}
}





@InCollection{HoosStuetzle00,
  author = 	 {Holger H. Hoos and Thomas St{\"u}tzle},
  title = 	 {{SATLIB}: An Online Resource for Research on {SAT}},
  booktitle = 	 {S{AT}2000: Highlights of Satisfiability Research
                   in the year 2000},
  pages = 	 {283--292},
  publisher = {Kluwer Academic},
  editor = {Ian Gent and Hans {van Maaren} and Toby Walsh},
  series = {Frontiers in Artificial Intelligence and Applications},
  year = 	 {2000}
}

@MastersThesis{Hutle02,
  author = 	 {M. Hutle},
  title = 	 {Constraint Satisfaction Problems - 
                  Hybrid Decomposition and Evaluation},
  school = 	 {Technical University of Vienna},
  year = 	 {2002},
}




# III #==================================================



@article {ImpagliazzoPaturiZane01,
    author = {Impagliazzo, Russell and Paturi, Ramamohan and Zane, Francis},
     title = {Which problems have strongly exponential complexity?},
   journal = JCSS,
    volume = {63},
      year = {2001},
    number = {4},
     pages = {512--530},
}

@InProceedings{Interian03,
  author = 	 {Yannet Interian},
  title = 	 {Backdoor sets for random 3-{S}{A}{T}},
  booktitle = 	 {Informal Proc. of the 
                  Sixth International Conference on Theory and 
                  Applications of Satisfiability Testing, 
                  S. Margherita Ligure - Portofino, Italy, 
                  May 5-8, 2003, (SAT 2003)},
  pages = 	 {231--238},
  year = 	 {2003},
}


@article {Iwama89,
    author = {Iwama, Kazuo},
     title = {C{NF}-satisfiability test by counting and polynomial average
              time},
   journal = SiamJC,
    volume = {18},
      year = {1989},
    number = {2},
     pages = {385--391},
}


@InProceedings{IwamaMiyano95,
  author        =  {Kazuo Iwama and Eiji Miyano},
  title         =  {Intractability of Read-Once Resolution},
  booktitle     =  {Proceedings of the Tenth Annual Structure in 
                    Complexity Theory Conference}, 
  pages         =  {29--36},
  year          =  {1995},
  address       =  {Minneapolis, Minnesota},
  publisher     =  {IEEE Computer Society Press}
}

@InProceedings{IwamaMiyazaki94,
    AUTHOR = {Iwama, Kazuo and Miyazaki, Shuichi},
     TITLE = {S{AT}-variable complexity of hard combinatorial problems},
 booktitle = {Information processing '94, Vol.\ I (Hamburg, 1994)},
    series = {IFIP Trans. A Comput. Sci. Tech., A-51},
     pages = {253--258},
 publisher = NorthHolland,
      year = {1994},
}


@InProceedings{Iwama97,
    author = {Iwama, Kazuo},
     title = {Complexity of finding short resolution proofs},
 booktitle = {Mathematical Foundations of Computer Science (MFCS 1997)},
    series = LNCS,
    volume = {1295},
     pages = {309--318},
 publisher = Springer,
      YEAR = {1997},
}
# JJJ #==================================================



@article {JacksonWhitty89,
    author = {Jackson, Bill and Whitty, R. W.},
     title = {A note concerning graphs with unique $f$-factors},
   journal = JGT,
    volume = 13,
      year = 1989,
    number = 5,
     pages = {577--580}
}
 
@article {JeavonsCohenGyssens97,
    author = {Jeavons, Peter and Cohen, David and Gyssens, Marc},
     title = {Closure properties of constraints},
   journal = JACM,
    volume = {44},
      year = {1997},
    number = {4},
     pages = {527--548},
}


@inproceedings {Johansson98,
    author = {Johansson, {\"O}jvind},
     title = {Clique-decomposition, {NLC}-decomposition, and modular
              decomposition---relationships and results for random graphs},
 booktitle = {Proceedings of the Twenty-ninth Southeastern International
              Conference on Combinatorics, Graph Theory and Computing (Boca
              Raton, FL, 1998)},
   series=  CongrNumer,
    volume = {132},
      year = {1998},
     pages = {39--60},
}



@InCollection{Johnson90,
  author = 	 {David S. Johnson},
  title = 	 {A catalog of complexity classes},
  booktitle = 	 {Handbook of Theoretical Computer Science},
  pages = 	 {67--161},
  publisher =    Elsevier,
  year = 	 {1990},
  editor = 	 {J. van Leewen},
  volume = 	 {A},
  chapter = 	 {2},
}




@Article{JohnsonG1999,
  author = 	 {Gerge Johnson},
  title = 	 {Separating the Insovable and the Merely Difficult},
  journal = 	 {The New York Times},
  year = 	 {1999},
  month = 	 {July 13},
}



@Article{JohnsonEtal89,
  author = 	 {D. S. Johnson and C. R. Aragon and L. A. McGeoch 
                  and C. Schevon},
  title = 	 {Optimization by Simulated Annealing: An Experimental 
                  Evaluation; Part {I}, Graph Partitioning},
  journal = 	 OR,
  year = 	 {1989},
  volume = 	 {37},
  number = 	 {6},
  pages = 	 {865--892},
}



@Book{Jungnickel87,
  author = 	 {Jungnickel, Dieter},
  title = 	 {Graphen, Netzwerke und Algorithmen},
  publisher = 	 {Bibliographisches Institut},
  year = 	 1987,
  address = 	 {Z\"urich},
}


@book{Jungnickel99,
    author = {Jungnickel, Dieter},
     title = {Graphs, networks and algorithms},
 publisher = Springer,
   address = {Berlin},
      year = {1999},
}



# KKK #==================================================



@InProceedings{KautzSelman92,
  author = 	 {Henry A. Kautz and Bart Selman},
  title = 	 {Planning as Satisfiability},
  booktitle = {Proceedings ECAI 1992},
  pages = 	 {359--363},
  year = 	 {1992},
}


@incollection {Karp72,
    author = {Karp, Richard M.},
     title = {Reducibility among combinatorial problems},
 booktitle = {Complexity of computer computations (Proc. Sympos., IBM Thomas
              J. Watson Res. Center, Yorktown Heights, N.Y., 1972)},
     pages = {85--103},
 publisher = {Plenum},
   address = {New York},
      year = {1972},
}





@TechReport{KarpinskiWirtgen97,
  author = 	 {Marek Karpinski and Juergen Wirtgen},
  title = 	 {On Approximation Hardness of the Bandwidth Problem},
  year = 	 {1997},
  number = 	 {TR97-041},
  address = 	 {ECCC, Electronic Colloquium on Computational Complexity},
}

@article {Kasif90,
    author = {Kasif, Simon},
     title = {On the parallel complexity of discrete relaxation in
              constraint satisfaction networks},
   journal = AI,
    volume = {45},
      year = {1990},
    number = {3},
     pages = {275--286},
}





@book{Kelley,
    author  = {Kelley, John L.},
    title   = {General Topology},
    year    = {1955},
    publisher = {Van Nostrand},
    address = {New York}
}



@inproceedings{KilbySlaneyThiebauxWalsh05,
  author    = {Philip Kilby and
               John K. Slaney and
               Sylvie Thi{\'e}baux and
               Toby Walsh},
  title     = {Backbones and Backdoors in Satisfiability.},
  booktitle  = {Proceedings, The Twentieth National Conference on Artificial
               Intelligence and the Seventeenth Innovative Applications
               of Artificial Intelligence Conference, July 9-13, 2005,
               Pittsburgh, Pennsylvania, USA (AAAI 2005)},
  year      = {2005},
  pages     = {1368--1373},
}


@article {Kinnersley92,
    author = {Kinnersley, Nancy G.},
     title = {The vertex separation number of a graph equals its path-width},
   journal = IPL,
    volume = {42},
      year = {1992},
    number = {6},
     pages = {345--350},
}


@article {KleineBuning93,
    author = {Kleine B{\"u}ning, Hans},
     title = {On generalized {H}orn formulas and {$k$}-resolution},
   journal = TCS,
    volume = {116},
      year = {1993},
    number = {2},
     pages = {405--413},
}




@article{KleinebuningKarpinskiFlogel95,
  author = 	{H. Kleine B\"uning and M. Karpinski and A. Fl\"ogel},
  title = 	{Resolution for Quantified {Boolean} Formulas},
  journal = 	InfComp,
  volume = 	{117},
  number =	{1},
  pages = 	{12--18},
  year = 	{1995}
}


@InProceedings{KleineBuning99,
  author = 	 {Hans {Kleine B\"uning}},
  title = 	 {An Upper Bound for Minimal Resolution Refutations},
  booktitle = 	 {CSL'98},
  pages = 	 {171--178},
  year = 	 {1999},
  editor = 	 {G. Gottlob and E. Grandjean and K. Seyr},
  volume = 	 {1584},
  series = 	 LNCS,
  publisher = Springer,
}


@book {KleineBuningLettman99,
    author = {Kleine B{\"u}ning, Hans and Lettman, Theodor},
     title = {Propositional logic: deduction and algorithms},
 publisher =  CamUP,
      year = {1999}
}





@Article{KleineBuning00,
  author = 	 {Hans {Kleine B\"uning}},
  title = 	 {On Subclasses of Minimal Unsatisfiable Formulas},
  journal = 	 DAM,
  year = 	 {2000},
  number =       {1--3},
  volume = 	 {107},
  pages = 	 {83--98},
}

@Unpublished{KleineBuningZhao01,
  author = 	 {Hans {Kleine B\"uning} and Xishun Zhao},
  title = 	 {Homomorphisms and {M}{U}$(k)$},
  month =        Mar,
  year = 	 {2001},
  note =         {Unpublished Manuscript}
}




@inproceedings{KleineBuningZhao01a,
  author = 	 {Hans {Kleine B\"uning} and Xishun Zhao},
  title = 	 {Satisfiable Formulas Closed Under Replacement},
  booktitle = 	 {Proceedings for the Workshop on Theory and 
                  Applications of Satisfiability},
  year = 	 {2001},
  editor = 	 {Henry Kautz and Bart Selman},
  volume = 	 {9},
  series = 	 ENDM,
  publisher =    Elsevier,
}






@TechReport{KleineBuningZhao02,
  author = 	 {Hans {Kleine B\"uning} and Xishun Zhao},
  title = 	 {Minimal Unsatisfiability: Results and Open Questions},
  institution =  {University of Paderborn},
  year = 	 {2002},
  type = 	 {Series Computer Science},
  number = 	 {tr-ri-02-230},
}


@article{KleineBuningZhao02a,
   author  =  {Hans {Kleine B\"uning} and Xishun Zhao},
   title   =  {Polynomial time algorithms for computing a representation 
            for minimal unsatisfiable formulas with fixed deficiency},
   journal =  IPL,
   volume  =  {84},
   number  = {3},
   pages   = {147-151},
   year    = {2002},

}



@Unpublished{KleineBuningXu02,
  author = 	 {Hans {Kleine B\"uning} and Daoyun Xu},
  title = 	 {The Complexity of Homomorphisms and Renamings of 
                  Minimal Unsatisfiable Formulas},
  note = 	 {Manuscript, submitted},
  year = 	 {2002},
}

@article {KleineBuningZhao03,
    author = {Kleine B{\"u}ning, Hans and Zhao, Xishun},
     title = {On the structure of some classes of minimal unsatisfiable
              formulas},
   journal = DAM,
    volume = {130},
      year = {2003},
    number = {2},
     pages = {185--207},
}



@article{Kloks96,
  author = 	 {T. Kloks},
  title = 	 {Treewidth of circle graphs},
  journal =  	 IJFCS,
  volume = 	 {7},
  year = 	 {1996},
  pages = 	 {111--120},
}




@incollection{Kneale1,
    author  = {Kneale, William C.},
    title   = {The Province of Logic},
    booktitle = {Contemporary British Philosophy},
    year    = {1958},
    editor  = {Lewis, Hywel David},
    publisher = {George Allen \& Unwin},
    address = {London},
    pages   = {237--261},
    series  = {Third Series}
}


@book{Kneale2,
    author  = {Kneale, William C. and Kneale, Martha},
    title   = {The Development of Logic},
    year    = {1962},
    publisher = {Oxford University Press},
    address = {Oxford}
}


@book{KnuthSGB,
    author  = {Donald E. Knuth},
    title   = {The Stanford GraphBase: a platform for combinatorial computing},
    year    = {1993},
    publisher = {ACM Press},
    address = {New York},
    note    = {Reprint. with corr.}
}


@article {Knuth90,
    author = {Knuth, Donald E.},
     title = {Nested satisfiability},
   journal = ActaInf,
    volume = {28},
      year = {1990},
    number = {1},
     pages = {1--6},
}
@article {KoblerRotics03,
    author = {Kobler, Daniel and Rotics, Udi},
     title = {Edge dominating set and colorings on graphs with fixed
              clique-width},
   journal = DAM,
    volume = {126},
      year = {2003},
    number = {2-3},
     pages = {197--221},
}


@Book{Koenig36,
  author = 	 {D\'{e}nes K\"{o}nig},
  title = 	 {Theorie der endlichen und unendlichen {Graphen}},
  publisher = 	 {Akademische Verlagsgesellschaft},
  year = 	 1936,
  address = 	 {Leipzig},
  note = 	 {Reprinted: Chelsea, New York, 1950},
}



@article {KolaitisVardi00,
    author = {Kolaitis, Phokion G. and Vardi, Moshe Y.},
     title = {Conjunctive-query containment and constraint satisfaction},
      note = {Special issue on the Seventeenth ACM SIGACT-SIGMOD-SIGART
              Symposium on Principles of Database Systems (Seattle, WA,
              1998)},
   journal = JCSS,
    volume = {61},
      year = {2000},
    number = {2},
     pages = {302--332},
}


@article {KosterBodlaenderVanHoesel01,
    author = {A. M. C. A. Koster and H. L. Bodlaender and S. P. M. van Hoesel},
     title = {Treewidth: {Computational} Experiments},
   journal = {Electronic Notes in Discrete Mathematics},
    volume = {8},
      year = {2001},
     publisher = {Elsevier Science Publishers}
}


@article {Kotzig59i,
    author = {Kotzig, Anton},
     title = {On the theory of finite graphs with a linear factor {I}},
   journal = MFSlovensk,
    volume = {9},
    number = {2},
      year = {1959},
     pages = {73--01}
}
@article {Kotzig59ii,
    author = {Kotzig, Anton},
     title = {On the theory of finite graphs with a linear factor {I}{I}},
   journal =  MFSlovensk,
    volume = {9},
    number = {3},
      year = {1959},
     pages = {136--159}
}
@article {Kotzig59iii,
    author = {Kotzig, Anton},
     title = {On the theory of finite graphs with a linear factor {I}{I}{I}},
   journal = MFSlovensk,
    volume = {10},
    number = {4},
      year = {1959},
     pages = {205--215}
}



@article{Kowalski75,
    author  = {Robert Kowalski},
    title   = {A Proof Procedure Using Connection Graphs},
    journal = JACM,
    year    = {1975},
    volume  = {22},
    number  = {4},
    pages   = {572--595},
    area    = {Theorem Proving}
}

@article{KratochM89,
    author  = {Jan Kratochv\'{\i}l and Ji\v{r}\'{\i} Matou\v{s}ek},
    title   = {{NP}-hardness results for intersection graphs},
    journal = CommMUC,
    year    = {1989},
    volume  = {30},
    number  = {4},
    pages   = {761--773}
}


@article{KratochP92,
    author  = {Jan Kratochv\'{\i}l and Svatopluk Poljak},
    title   = {Compatible $2$-factors},
    journal = DAM,
    year    = {1992},
    volume  = {36},
    pages   = {253--266}
}


@article{KratochK93,
    author  = {Jan Kratochv\'{\i}l and Mirko K\v{r}iv\'{a}nek},
    title   = {Satisfiability and co-nested formulas},
    journal = ActaInf,
    year    = {1993},
    volume  = {30},
    pages   = {397--403}
}
@article{KratochST93,
    author  = {Jan Kratochv\'{\i}l and Petr Savick\'{y} and Zsolt Tuza},
    title   = {One more occurrence of variables make satisfiability
    	jump from trivial to {NP}-complete},
    journal = ActaInf,
    year    = {1993},
    volume  = {30},
    pages   = {397--403}
}

@article{Kratoch94,
    author  = {Jan Kratochv\'{\i}l},
    title   = {A special planar satisfiability problem
    	and a consequence of its {NP}-completeness},
    journal = DAM,
    year    = {1994},
    volume  = {52},
    pages   = {233--252}
}

@article{Krish85,
    author  = {Balakrishnan Krishnamurthy},
    title   = {Short Proofs for Tricky Formulas},
    journal = ActaInf,
    year    = {1985},
    volume  = {22},
    pages   = {253--275}
}


@InProceedings{KrokhinBulatovJeavons05,
 author = 	 {A. Krokhin and A. Bulatov and P. Jeavons},
  title = 	 {The complexity of constraint satisfaction: 
                  An algebraic approach},
  booktitle = {Structural Theory of Automata, 
                 Semigroups and Universal Algebra (Montreal, 2003)},
  pages = 	 {181--213},
  year = 	 {2005},
  number = 	 {207},
  series = 	 {NATO Science Series II: Mathematics, Physics, and Chemistry},
}



@InProceedings{Kullmann99d,
  author =    {Oliver Kullmann},
  title =     {An application of matroid theory to the {SAT} problem},
  booktitle = {Fifteenth Annual IEEE Conference on Computational 
                Complexity},
  pages =     {116-124},
  note =      {See also TR00-018, Electronic Colloquium on Computational 
               Complexity (ECCC), March 2000},
  year =      {2000},
}


@InProceedings{Kullmann99d-short,
  author =    {Oliver Kullmann},
  title =     {An application of matroid theory to the {SAT} problem},
  booktitle = {Fifteenth Annual IEEE Conference on Computational 
                Complexity},
  year  =     {2000},
  pages =     {116-124}
}



@TechReport{Kullmann99f,
  author = 	 {Oliver Kullmann},
  title = 	 {Investigating a general hierarchy of polynomially 
                 decidable classes of {C}{N}{F}'s based on short tree-like 
                 resolution proofs},
  institution =  ECCC,
  year = 	 {1999},
  number = 	 {TR99--041},
}



@TechReport{Kullmann00,
  author = 	 {Oliver Kullmann},
  title = 	 {An application of matroid theory to the {SAT} problem },
  institution =  ECCC,
  year = 	 {2000},
  number = 	 {TR00--018},
}




@article{Kullmann00a,
    author  = {Oliver Kullmann},
    title   = {Investigations on autark assignments},
    journal = DAM,
    year    = {2000},
    volume  = {107},
    number =  {1-3},
    pages   = {99--137}
}



@article{Kullmann00f,
    author  = {Oliver Kullmann},
    title   = {Lean clause-sets: Generalizations of minimally unsatisfiable 
                clause-sets},
    journal = DAM,
    year    = {2003},
    volume  = {130},
    number =  {2},
    pages   = {209-249}
}


 @Unpublished{Kullmann00f,
   author =   {Oliver Kullmann},
   title =    {Lean clause-sets: Generalizations of minimally unsatisfiable 
                clause-sets},
   note =     DAM-ta,
 }






@InProceedings{Kullmann01,
  author = 	 {Oliver Kullmann},
  title = 	 {On the use of autarkies for satisfiability decision},
  booktitle = 	 {Proceedings for the Workshop on Theory and 
                  Applications of Satisfiability},
  year = 	 {2001},
  editor =       {Henry Kautz and Bart Selman},
  series = 	 ENDM,
  publisher =    Elsevier,
}

@Misc{KullmannPCa,
  author = 	 {Oliver Kullmann},
  title = 	 {Personal communication},
}



@inproceedings{Kullmann03,
  author =    {Oliver Kullmann},
  title     = {The Combinatorics of Conflicts between Clauses},
  booktitle = {Sixth International Conference on Theory and 
                  Applications of Satisfiability Testing, 
                  S. Margherita Ligure - Portofino, Italy, 
                  May 5-8, 2003 (SAT 2003)},
  publisher = Springer,
  series    = LNCS,
  volume    = {2919},
  year      = {2004},
  editor    = {Enrico Giunchiglia and
               Armando Tacchella},
}



@TechReport{Kullmann05,
  author = 	 {Oliver Kullmann},
  title = 	 {Conjunctive normal forms with non-boolean 
                  variables, autarkies and hypergraph colouring},
  institution =  {University of Wales Swansea},
  year = 	 {2005},
  type = 	 {Computer Science Report Series},
  number = 	 {CSR 5-2005},
  month = 	 MAR,
}

# LLL #==================================================


@article{Lagergren96,
    author  = {J. Lagergren},
    title   = {Efficient parallel algorithms for graphs of bounded tree-width},
    journal = JAlg,
    year    = {1996},
    volume  = {20},
    number  = {1},
    pages   = {20--44}
}




@article{Lewis78,
    author  = {Harry R. Lewis},
    title   = {Renaming a Set of Clauses as a {Horn} Set},
    journal = JACM,
    year    = {1978},
    month   = jan,
    volume  = {25},
    number  = {1},
    pages   = {134--135}
}

 





@Book{Libkin04,
  author = 	 {Leonid Libkin},
  title = 	 {Elements of Finite Model Theory},
  publisher = 	 Springer,
  year = 	 {2004},
  note = 	 {To appear},
}

@article {Lichtenstein82,
    author = {Lichtenstein, David},
     title = {Planar formulae and their uses},
   journal = SiamJC,
    volume = {11},
      year = {1982},
    number = {2},
     pages = {329--343},
}


@inproceedings{LynceMarquesSilva04,
  author    = {In{\^e}s Lynce and
               Jo{\~a}o P. Marques-Silva},
  title     = {Hidden Structure in Unsatisfiable Random 3-{SAT}: An Empirical
               Study.},
  booktitle = {16th IEEE International Conference on Tools with Artificial
               Intelligence (ICTAI 2004), 15-17 November 2004, Boca Raton,
               FL, USA},
  publisher = {IEEE Computer Society},
  year      = {2004},
  pages     = {246--251},
}


@article {LittleGrantHolton76,
    author = {Little, Charles H. C. and Grant, Douglas D. and Holton, D. A.},
     title = {On defect-$d$ matchings in graphs},
   journal = DM,
    volume = {13},
      year = {1975},
    number = {1},
     pages = {41--54},
}
@article {LittleGrantHolton76err,
    author = {Little, Charles H. C. and Grant, Douglas D. and Holton, D. A.},
     title = {Erratum: ``{O}n defect-$d$ matching in graphs'' ({D}iscrete
              {M}ath. 13 (1975), 41--54)},
   journal = DM,
    volume = {14},
      year = {1976},
    number = {2},
     pages = {203},
}

@article {LoncTruszczynski03,
    author = {Lonc, Zbigniew and Truszczy{\'n}ski, Miroslaw},
     title = {Fixed-parameter complexity of semantics for logic programs},
   journal = ACMTCL,
    volume = {4},
      year = {2003},
    number = {1},
     pages = {91--119},
}


@Book{LovaszPlummer86,
  author = 	 {L. Lov\'{a}sz and M. D. Plummer},
  title = 	 {Matching Theory},
  publisher = 	 NorthHolland,
  address =      {Amsterdam},
  year = 	 {1986},
  volume = 	 {29},
  series = 	 {Annals of Discrete Mathematics},
}

@article {LozinRautenbach04,
    author = {Lozin, V. and Rautenbach, D.},
     title = {On the band-, tree-, and clique-width of graphs with bounded
              vertex degree},
   journal = SiamJDM,
    volume = {18},
      year = {2004},
    number = {1},
     pages = {195--206},
}
@article {LozinRautenbach04b,
    author = {Lozin, V. and Rautenbach, D.},
     title = {Chordal bipartite graphs of bounded tree- and clique-width},
   journal = DM,
    volume = {283},
      year = {2004},
    number = {1-3},
     pages = {151--158},
}




# MMM #==================================================



@InCollection{Mackworth92,
  author = 	 {Mackworth, A. K.},
  title = 	 {Constraint satisfaction},
  booktitle = 	 {Encyclopedia of Artificial Intelligence},
  pages = 	 {285-293},
  publisher = Wiley,
  year = 	 {1992},
  editor = 	 {S. C. Shapiro},
  volume = 	 {1},
  edition = 	 {2},
}




@Article{MahajanRaman99,
  author = 	 {Meena Mahajan and Venkatesh Raman},
  title = 	 {Parameterizing above Guaranteed Values: 
                  {M}ax{S}at and {M}ax{C}ut},
  journal = 	 JAlg, 
  year = 	 {1999},
  volume = 	 {31},
  number = 	 {2},
  pages = 	 {335-354},
}


@inproceedings{MahajanRamanSikdar06,
  author    = {Meena Mahajan and
               Venkatesh Raman and
               Somnath Sikdar},
  title     = {Parameterizing {MAX} {SNP} Problems Above Guaranteed Values},
  booktitle = {Parameterized and Exact Computation, Second International
               Workshop, IWPEC 2006, Z{\"u}rich, Switzerland, September
               13-15, 2006, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4169},
  year      = {2006},
  pages     = {38--49},
}



@Article{Malik94,
  author = 	 {Sharad Malik},
  title = 	 {Analysis of Cyclic Combinatorial Circuits},
  journal = 	 IEEECAD,
  year = 	 {1994},
  volume = 	 {13},
  number = 	 {7},
  pages = 	 {950--956},
}

@article {Manoussakis92,
    author = {Manoussakis, Y.},
     title = {Alternating paths in edge-colored complete graphs},
   journal = DAM,
    volume = {56},
      year = {1995},
    number = {2--3},
     pages = {297--309}
}



@Article{Marx04,
  author = 	 {Marx, D\'aniel},
  title = 	 {Parameterized complexity of constraint 
                  satisfaction problems},
  journal = 	 ComCom,
  year = 	 {2005},
  volume = 	 {14},
  number = 	 {2},
  pages = 	 {153--183},
}

@InProceedings{MaussSeelischTatar02,
  author = 	 {Jakob Mauss and Frank Seelisch and Mugur M. Tatar},
  title = 	 {A Relational Constraint Solver for Model-Based Engineering},
  booktitle = 	 {8th International Conference on Principles and 
                  Practice of Constraint Programming (CP 2002)},
  pages = 	 {696--701},
  year = 	 {2002},
  editor = 	 {Pascal Van Hentenryck},
  volume = 	 {2470},
  series = 	 LNCS,
  publisher =    Springer,
}

@article{Mehlh95,
    author  = {Kurt Mehlhorn and Stefan N\"{a}her},
    title   = {{LEDA:} a platform for Combinatorial and Geometric Computing},
    journal = CommACM,
    year    = {1995},
    volume  = {38},
    number  = {1},
    pages   = {96--102}
}

@manual{Mehlh98,
    author  = {Kurt Mehlhorn and Stefan N\"{a}her and Michael Seel and Christian Uhrig},
    title   = {The {LEDA} User Manual, Version 3.6},
    organization = {Max-Planck-Institut f. Informatik, Saarbr\"{u}cken},
    year    = {1998}
}

@article{Meltzer66refw,
    author  = {B. Meltzer},
    title   = {Theorem-proving for computers:
     some results on resolution and renaming},
    journal = TCJ,
    year    = {1966},
    volume  = {8},
    pages   = {341--343},
    note    = {reprinted in \cite{Siekm83a}}
}
@article{Meltzer66,
    author  = {B. Meltzer},
    title   = {Theorem-proving for computers:
     some results on resolution and renaming},
    journal = TCJ,
    year    = {1966},
    volume  = {8},
    pages   = {341--343},
}






@InProceedings{MicaliVazirani80,
  author = 	 {S. Micali and V. V. Vazirani},
  title = 	 {An ${O}(\sqrt{|{V}|}\cdot |{E}|)$ algorithm for finding 
                  a maximum matching in general graphs}, 
  booktitle = 	 {Proceedings of the 21st Annual IEEE Symposium on 
                  the Foundations of Computer Science},
  pages = 	 {17--27},
  year = 	 1980,
}




@Article{MichelenaPapalambros95,
  author = 	 {Michelena, N.F. and Papalambros, P.Y.},
  title = 	 {A Network Reliability Approach to Optimal Decomposition 
                  of Design Problems},
  journal = 	 {ASME J. of Mechanical Design},
  year = 	 {1995},
  volume = 	 {117},
  number = 	 {3},
  pages = 	 {433--440},
}

@InProceedings{Mitchell98,
  author = 	 {David G. Mitchell},
  title = 	 {Hard Problems for {C}{S}{P} Algorithms},
  booktitle = 	 {15th National Conference on Artificial Intelligence and 
                  10th Innovative Applications of Artificial Intelligence 
                 Conference (AAAI'98/IAAI'98)},
  pages = 	 {398--405},
  year = 	 {1998},
  publisher = {The MIT Press},
}

@article {MonassonEtal99,
    author = {Monasson, R{\'e}mi and Zecchina, Riccardo and Kirkpatrick,
              Scott and Selman, Bart and Troyansky, Lidror},
     title = {Determining computational complexity from characteristic
              ``phase transitions''},
   journal = {Nature},
    volume = {400},
      year = {1999},
    number = {6740},
     pages = {133--137},
}




@Article{MonienSpeckenmeyer85,
  author = 	 {B. Monien and E. Speckenmeyer},
  title = 	 {Solving Satisfiability in less than $2^n$ steps},
  journal = 	 DAM,
  year = 	 {1985},
  volume = 	 {10},
  pages = 	 {287--295},
}

@book{MoretShapiro,
    author  = {Bernard M.E. Moret and H.D. Shapiro},
    title   = {Algorithms from P to NP: Design and efficiency},
    year    = {1991},
    publisher = {Benjamin \& Cummings Publishing},
    address = {Redwood City, Calif.}
}



# NNN #==================================================


@inproceedings{Nash79a,
    author  = {Nash-Williams, C. St. J. A.},
    title   = {Acyclic Detachments of Graphs},
    booktitle = {Proc. Conf. Open Univ. on Graph Theory and Combinatorics},
    year    = {1979},
    address  = {Milton Keynes},
    publisher = {Pitman},
    pages   = {87--97}
}


@article{Nash85b,
    author  = {Nash-Williams, C. St. J. A.},
    title   = {Connected Detachments of Graphs and Generalized {E}uler Trails},
    journal = JLMSoc,
    year    = {1985},
    volume  = {2},
    pages   = {17--29}
}

@article{Nash87a,
    author  = {Nash-Williams, C. St. J. A.},
    title   = {Amalgamations of Almost Regular Edge-Colourings of Simple Graphs},
    journal = JCombTB,
    year    = {1987},
    volume  = {43},
    pages   = {322--342}
}


@article {Nesetril99,
    author = {Ne{\v{s}}et{\v{r}}il, Jaroslav},
     title = {The homomorphism structure of classes of graphs},
      note = {Recent trends in combinatorics (M\'atrah\'aza, 1995)},
   journal = CPC,
    volume = {8},
      year = {1999},
    number = {1-2},
     pages = {177--184},
}




@Book{Niedermeier06,
  author = 	 {Rolf Niedermeier},
  title = 	 {Invitation to Fixed-Parameter Algorithms},
  publisher = 	 OUP,
  address =   {Oxford},
  year = 	 {2006},
  series = 	 {Oxford Lecture Series in Mathematics and its Applications},
}

@article {NiedermeierRossmanith00,
    author = {Niedermeier, Rolf and Rossmanith, Peter},
     title = {New upper bounds for maximum satisfiability},
   journal = JAlg,
    volume = {36},
      year = {2000},
    number = {1},
     pages = {63--88},
}


@article{NiedermeierRossmanith03,
  author    = {Rolf Niedermeier and
               Peter Rossmanith},
  title     = {An efficient fixed-parameter algorithm for 3-Hitting Set.},
  journal   = JDA,
  volume    = {1},
  number    = {1},
  year      = {2003},
  pages     = {89--102},
}


@Article{NishimuraRagdeThilikos05,
 author = {Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos},
 title =  {Fast Fixed-Parameter Tractable Algorithms for 
           Nontrivial Generalizations of Vertex Cover},
journal =  DAM,
 year =   {2005},
note = 	  {To appear},
 }

# OOO #==================================================

@article {Ore55,
    author = {Ore, Oystein},
     title = {Graphs and matching theorems},
   journal = DukeMJ,
    volume = {22},
      year = {1955},
     pages = {625--639},
}

@book {Ore62,
    author = {Ore, Oystein},
     title = {Theory of graphs},
    series = {American Mathematical Society Colloquium Publications},
    volume = {XXXVIII},
 publisher = {American Mathematical Society},
   address = {Providence, R.I.},
      year = {1962},
}



@InProceedings{OtwellRemshagenTruemper04,
  author = 	 {Charles Otwell and  Anja Remshagen and Klaus Truemper},
  title = 	 {An Effective {QBF} Solver for Planning Problems},
  booktitle = {Proceedings of MSV/AMCS},
  pages = 	 {311-316},
  year = 	 {2004},
  publisher = {CSREA Press},
}


@inproceedings{Oum05,
  author    = {{Sang-il} Oum},
  title     = {Approximating Rank-Width and Clique-Width Quickly},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International
               Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised
               Selected Papers},
  pages     = {49--58},
 volume    = {3787},
  year      = {2005},
 publisher = Springer,
 series    = LNCS,

}

@proceedings{DBLP:conf/wg/2005,
  editor    = {Dieter Kratsch},
  title     = {Graph-Theoretic Concepts in Computer Science, 31st International
               Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised
               Selected Papers},
  booktitle = {WG},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3787},
  year      = {2005},
  isbn      = {3-540-31000-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}



@Article{OumSeymour06,
  author = 	 {{Sang-il} Oum and P. Seymour},
  title = 	 {Approximating Clique-width and Branch-width},
  journal = 	 JCombTB,
  volume =       96,
 number =         4,
 pages =         {514--528},
  year = 	 2006,
}

 


# PPP #==================================================


@Article{PapadimitriouYannakakis84,
  author = 	 {Christos H. Papadimitriou and M. Yannakakis},
  title = 	 {The Complexity of Facets (and Some Facets of Complexity)},
  journal = 	 JCSS,
  year = 	 {1984},
  volume = 	 {28},
  number =       {2},
  pages = 	 {244--259},
}

@article {PapadimitriouYannakakis99,
    author = {Papadimitriou, Christos H. and Yannakakis, Mihalis},
     title = {On the complexity of database queries},
   journal = JCSS,
    volume = {58},
      year = {1999},
    number = {3},
     pages = {407--427},
}


@Article{PapadimitriouWolfe88,
  author = 	 {Christos H. Papadimitriou and David Wolfe},
  title = 	 {The Complexity of Facets Resolved},
  journal = 	 JCSS,
  year = 	 {1988},
  volume = 	 {37},
  number =       {1},
  pages = 	 {2--13},
}





@Book{Papadimitriou94,
 author = 	 {Christos H. Papadimitriou},
  title = 	 {Computational Complexity},
  publisher = 	 AW,
  year = 	 {1994},
}




@Article{PrasadBiereGupta05,
  author = 	 {M. Prasad, A. Biere, A. Gupta},
  title = 	 {A survey of recent advances in {SAT}-based formal
                  verification},
  journal = 	 {Software Tools for Technology Transfer},
  year = 	 {2005},
  volume = 	 {7},
  number = 	 {2},
  pages = 	 {156--173},
}

@TechReport{PearsonJeavons97,
  author = 	 {J. K. Pearson and P. G. Jeavons },
  title = 	 {A survey of tractable constraint satisfaction problems},
  institution =  {Royal Holloway, University of London},
  year = 	 {1997},
  number = 	 {Technical Report CSD-TR-97-15},
}

@article {PetersonLoui88,
    author = {Peterson, Paul A. and Loui, Michael C.},
     title = {The general maximum matching algorithm of {M}icali and
              {V}azirani},
   journal = Alg,
    volume = {3},
      year = {1988},
    number = {4},
     pages = {511--533},
}
 



@PhdThesis{Pitassi92,
  author = 	 {Pitassi, Toniann},
  title = 	 {The power of weak formal systems},
  school = 	 {Department of Computer Science, University of Toronto},
  year = 	 {1992},
}

@article {PitassiToniannUrquhart95,
    author = {Pitassi, Toniann and Urquhart, Alasdair},
     title = {The complexity of the {H}aj\'os calculus},
   journal = SiamJDM,
    volume = 8,
      year = 1995,
    number = 3,
     pages = {464--483},
} 




@TechReport{Pitassi03,
  author = 	 {Pitassi, Toniann},
  title = 	 {Theory Open Problems Session},
  institution =  {Department of Computer Science, University of Toronto},
  year = 	 {2003},
  month = 	 {June},
  note = 	 {\url{http://www.cs.toronto.edu/~toni/TheoryProblems/open.ps}},
}


 
@article {PitassiIwama95,
    author = {Iwama, Kazuo and Pitassi, Toniann},
     title = {Exponential lower bounds for the tree-like {H}aj\'os calculus},
   journal = IPL,
    volume = {54},
      year = {1995},
    number = {5},
     pages = {289--294},
}


@book{Praw65,
    author  = {Prawitz, Dag},
    title   = {Natural Deduction},
    year    = {1965},
    publisher = {Almqvist \& Wiksell},
    address = {Uppsala},
    series  = {Stockholm Studies in Philosophy 3}
}



@incollection {Prawitz69,
    author = {Prawitz, D.},
     title = {Advances and problems in mechanical proof procedures},
 booktitle = {Machine Intelligence},
     volume = {4},
     pages = {59--71},
 publisher = {American Elsevier, New York},
      year = {1969}
}




@phdthesis{Prelotani93,
    author  = {Daniele Prelotani},
    title   = {Satisfiability and Hypergraphs},
    year    = {1993},
    month   = mar,
    school  = {Department of Computer Science, University of Pisa, Italy}
}

@inproceedings{Prelotani96,
    author  = {Daniele Prelotani},
    title   = {Efficiency and Stability of Hypergraph {SAT} Algorithms},
    booktitle = {Cliques, Coloring and Satisfiability},
    year    = {1996},
    editor  = {David S. Johnson and Michael A. Trick},
    publisher = {AMS},
    pages   = {479--498}
}

@article {Pretolani94,
    author = {Pretolani, Daniele},
     title = {Hierarchies of polynomially solvable satisfiability problems},
   journal = AMAI,
    volume = {17},
      year = {1996},
    number = {3-4},
     pages = {339--357},
}



@Unpublished{Prestwich03,
  author = 	 {Steven Prestwich},
  title = 	 {Local Search on {SAT} encoded {CSPs}},
  note = 	 {(Informal) proceedings of the Sixth International 
                  Conference on Theory and 
                  Applications of Satisfiability Testing (SAT'03), 
                  388--399},
  year = 	 {2003},
}

@book{PultrTrnkova80,
    author = {Pultr, Ale{\v{s}} and Trnkov{\'a}, V{\v{e}}ra},
     title = {Combinatorial, algebraic and topological representations of
              groups, semigroups and categories},
 publisher = {North-Holland Publishing Co.},
   address = {Amsterdam},
      YEAR = {1980},
}




# QQQ #==================================================


# RRR #==================================================




@PhdThesis{Reckhow75,
  author = 	 {Robert A. Reckhow},
  title = 	 {On the Length of Proofs in the Propositional Calculus},
  school = 	 {Department of Computer Science, University of Toronto},
  year = 	 {1976},
}

@article {ReedSmithVetta04,
    author = {Reed, Bruce and Smith, Kaleigh and Vetta, Adrian},
     title = {Finding odd cycle transversals},
   journal = ORL,
    volume = {32},
      year = {2004},
    number = {4},
     pages = {299--301},
}



@InProceedings{Reed92,
  author = 	 {B. Reed},
  title = 	 {Finding approximate separators and computing 
                  tree-width quickly},
  booktitle =    {Proceedings of the 24th Annual 
                 ACM symposium on Theory of Computing (STOC'92)},
  pages = 	 {221--228},
  year = 	 {1992},
  publisher =    {ACM},
}







@Article{Rintanen99,
  author = 	 {J. Rintanen},
  title = 	 {Constructing Conditional Plans by a Theorem-Prover},
  journal = 	 JAIR,
  year = 	 {1999},
  volume = 	 {10},
  pages = 	 {323--352},
}

@article {RobertsonSeymour86,
    author = {Robertson, Neil and Seymour, P. D.},
     title = {Graph minors. {II}. {A}lgorithmic aspects of tree-width},
   journal = JAlg,
    volume = {7},
      year = {1986},
    number = {3},
     pages = {309--322},
}


@article {RobertsonSeymour86b,
    author = {Robertson, Neil and Seymour, P. D.},
     title = {Graph minors. {V}. {E}xcluding a planar graph},
   journal = JCombTB,
    volume = {41},
      year = {1986},
    number = {1},
     pages = {92--114},
}

@article {RobertsonSeymourThomas94,
    author = {Robertson, Neil and Seymour, Paul and Thomas, Robin},
     title = {Quickly excluding a planar graph},
   journal = JCombTB,
    volume = {62},
      year = {1994},
    number = {2},
     pages = {323--348},
}



@article {RobertsonSeymour91,
    author = {Robertson, Neil and Seymour, P. D.},
     title = {Graph minors~{X}. {O}bstructions to tree-decomposition},
   journal = JCombTB,
    volume = {52},
      year = {1991},
    number = {2},
     pages = {153--190},
}


@article {RobertsonSeymour95,
    author = {Robertson, Neil and Seymour, P. D.},
     title = {Graph minors. {XIII}. {T}he disjoint paths problem},
   journal = JCombTB,
    volume = {63},
      year = {1995},
    number = {1},
     pages = {65--110},
}

@article{Robinson65,
    author  = {Robinson, J. A.},
    title   = {A Machine-Oriented Logic Based on the Resolution Principle},
    journal = JACM,
    year    = {1965},
    volume  = {12},
    number  = {1},
    pages   = {23--41}
}


%deprecated
@article{Robinson,
    author  = {Robinson, J. A.},
    title   = {A Machine-Oriented Logic Based on the Resolution Principle},
    journal = JACM,
    year    = {1965},
    volume  = {12},
    number  = {1},
    pages   = {23--41}
}


@article {RoseTarjanLueker76,
    author = {D. J. Rose and R. E. Tarjan and G. S. Lueker},
     title = {Algorithmic aspects of vertex elimination on graphs},
   journal = SIAMJC,
    volume = {5},
      year = {1976},
     pages = {266--283},
}


@article {Roth96,
    author = {Roth, Dan},
     title = {On the hardness of approximate reasoning},
   journal = AI,
    volume = {82},
      year = {1996},
    number = {1-2},
     pages = {273--302},
}


@inproceedings{RousselMathieu96,
    author  = {Olivier Roussel and Philippe Mathieu},
    title   = {A New Method for Knowledge Compilation:
     The Achievement by Cycle Search},
    booktitle = {Automated Deduction - {CADE-13}},
    year    = {1996},
    editor  = {M. A. McRobbie and J. K. Slaney},
    publisher = Springer,
    pages   = {493--507},
    series  = {Lecture Notes in Artificial Intelligence 1104}
}



@InProceedings{RuanKautzHorvitz04,
  author = 	 {Yongshao Ruan and Henry A. Kautz and Eric Horvitz},
  title = 	 {The Backdoor Key: A Path to Understanding Problem Hardness},
   booktitle =   {Proceedings of the 19th National Conference on Artificial
                  Intelligence, 16th Conference on Innovative Applications
                  of Artificial Intelligence},
  pages = 	 {124--130},
  year = 	 {2004},
  editor    =    {Deborah L. McGuinness and George Ferguson},
  publisher = {AAAI Press / The MIT Press},
}

# SSS #==================================================



@article{Sabidussi61,
    author  = {Gert Sabidussi},
    title   = {Graph Derivatives},
    journal = {Math. Z.},
    year    = {1961},
    volume  = {76},
    pages   = {385--401}
}

@article{Sabidussi64,
    author  = {Gert Sabidussi},
    title   = {Vertex-transitive graphs},
    journal = {Monatsh. Math.},
    year    = {1964},
    volume  = {68},
    pages   = {426--438}
}


 @InProceedings{SabharwalAnsoteguiGomesHartSelman06,
  author = 	 {A. Sabharwal and C. Ansotegui and C. Gomes and  
                  J. Hart and B. Selman},
  title = 	 {{QBF} Modeling: Exploiting Player Symmetry for 
                  Simplicity and Efficiency},
  booktitle = {Proceedings of SAT 2006, Ninth International Conference on 
               Theory and Applications of Satisfiability Testing,  
                August 12-15, 2006, Seattle, Washington, USA},
  pages = 	 {382--395},
  year = 	 {2006},
  volume = 	 {4121},
  series = 	 {LNCS},
}

@article {SavickySgall00,
    author = {Savick{\'y}, P. and Sgall, Ji{\v{r}}{\'\i}},
     title = {D{NF} tautologies with a limited number of occurrences of
              every variable},
   journal = TCS,
    volume = {238},
      year = {2000},
    number = {1-2},
     pages = {495--498},
}


@incollection {Schaefer78,
    author = {Schaefer, Thomas J.},
     title = {The complexity of satisfiability problems},
 booktitle = {Conference Record of the Tenth Annual ACM Symposium on Theory
              of Computing (San Diego, Calif., 1978)},
     pages = {216--226},
 publisher = {ACM},
      YEAR = {1978},
}

@TechReport{Schaefer01,
  author = 	 {Marcus Schaefer},
  title = 	 {Completeness in the polynomial-time hierarchy},
  institution =  {School of CTI, DePaul University},
  year = 	 {2001},
  number = 	 {TR01-009},
  address = 	 {Chicago, IL},
  month = 	 JUL,
}
@TechReport{SchaeferUmans04,
  author = 	 {Marcus Schaefer and Christopher Umans},
  title = 	 {Completeness in the polynomial-time hierarchy},
   year = 	 {2004},
  note  = 	 {\url{http://ovid.cs.depaul.edu/documents/phcom.ps}}
}

@incollection {Scheffler90,
    author = {Scheffler, Petra},
     title = {A linear algorithm for the pathwidth of trees},
 booktitle = {Topics in combinatorics and graph theory (Oberwolfach, 1990)},
     pages = {613--620},
 publisher = {Physica},
      year = {1990},
}



@article {SchlipfEtal95,
    AUTHOR = {Schlipf, John S. and Annexstein, Fred S. and Franco, John V.
              and Swaminathan, R. P.},
     TITLE = {On finding solutions for extended {H}orn formulas},
   JOURNAL = IPL,
    VOLUME = {54},
      YEAR = {1995},
    NUMBER = {3},
     PAGES = {133--137},
}




@article {Seese91,
    author = {Seese, D.},
     title = {The structure of the models of decidable monadic theories of
              graphs},
   journal = APAL,
    volume = {53},
      year = {1991},
    number = {2},
     pages = {169--195},
}


@InCollection{Seymour79,
  author = 	 {P. D. Seymour},
  title = 	 {Sums of Circuits},
  booktitle = 	 {Graph Theory and Related Topics},
  pages = 	 {341--355},
  publisher =    AcademicPress,
  address =      {New York--London},
  year = 	 {1979},
  editor = 	 {J. A. Bondy and U. S. R. Murty},
}

@article {SeymourThomas94,
    author = {Seymour, P. D. and Thomas, R.},
     title = {Call routing and the ratcatcher},
   journal = Comb,
    volume = {14},
      year = {1994},
    number = {2},
     pages = {217--241},
}



@book{ShoesmithSmiley78,
    author  = {Shoesmith, D. J. and Smiley, T. J.},
    title   = {Multiple-conclusion Logic},
    year    = {1978},
    publisher = CamUP
}

@article{ShoesmithSmiley79, 
    author  = {Shoesmith, D. J. and Smiley, T. J.},
    title   = {Theorem on Directed Graphs, Applicable to Logic},
    journal = JGT,
    year    = {1979},
    number  = {4},
    volume  = {3},
    pages   = {401--406}
}



@article{Shostak76,
    author  = {Robert E. Shostak},
    title   = {Refutation Graphs},
    journal = AI,
    year    = {1976},
    volume  = {7},
    pages   = {51--64}
}






@book{Siekm83a,
    title   = {Automation of Reasoning. Classical Papers on Computer 
Science 1957--1966},
    year    = {1983},
    editor  = {J{\"o}rg Siekmann and Graham Wrightson},
    publisher = Springer,
    volume  = {1}
}


@book{Siekm83b,
    title   = {Automation of reasoning. Classical Papers on Computer Science 1967--1970},
    year    = {1983},
    editor  = {J{\"o}rg Siekmann and Graham Wrightson},
    publisher = Springer,
    volume  = {2}
}






@InProceedings{Simonis05,
  author = 	 {Helmut Simonis},
  title = 	 {Sudoku as a Constraint Problem},
  booktitle = {Modelling and Reformulating Constraint Satisfaction
               Problems, Fourth International Workshop,
               Sitges (Barcelona), Spain, 1 October 2005, 
               Proceedings},
  pages = 	 {13--27},
  editor = 	 {Brahim Hnich and Patrick Prosser and Barbara Smith},
  year = 	 {2005},
}









@unpublished{Spinrad97,
  author = 	 {Spinrad, Jeremy  P.},
  title = 	 {Representations of graphs},
  note = 	 {{B}ook manuscript, Vanderbilt University},
  year = 	 {1997}
}




@Book{Spinrad03,
  author =       {Spinrad, Jeremy  P.},
  title = 	 {Efficient Graph Representations},
  publisher = 	 {AMS},
  year = 	 {2003},
  Tnumber = 	 {19},
  series = 	 {Fields Institute Monographs},
}

@phdthesis{StatmanPHD,
    author  = {Statman, Richard},
    title   = {Structural Complexity of Proofs},
    year    = {1974},
    month   = may,
    school  = {Stanford University}
}

@article {Stockmeyer76,
    author = {Stockmeyer, Larry J.},
     title = {The polynomial-time hierarchy},
   journal = TCS,
    volume = {3},
      year = {1976},
    number = {1},
     pages = {1--22},
}

@inproceedings{StockmeyerMeyer73,
  author =	{L. J. Stockmeyer and A. R. Meyer},
  title =	{Word problems requiring exponential time},
  booktitle =	{Proc. Theory of Computing},
  publisher =	{ACM},
  pages =	{1--9},
  year =	{1973}
}


@MastersThesis{Stribrna94,
  author = 	 {J. St\v{r}\'{\i}brn\'{a}},
  title = 	 {Between combinatorics and formal logic},
  school = 	 {Charles University},
  year = 	 {1994},
  address = 	 {Prague},
}




@InProceedings{StumptnerWotawa03,
  author = 	 {Markus Stumptner and Franz Wotawa},
  title = 	 {Coupling {CSP} Decomposition Methods and 
                  Diagnosis Algorithms for Tree-Structured Systems},
  booktitle = 	 {18th International Joint Conference on Artificial 
                  Intelligence (IJCAI 03)},
  note = 	 {To appear},
}



@article{SundaramSherSinghPanduRangan94,
  author = 	 {R. Sundaram and K. Sher Singh and C. Pandu Rangan},
  title = 	 {Treewidth of circular-arc graphs},
  journal = 	 SIAMJDM,
  year = 	 {1994},
  volume = 	 {7},
  number = 	 {4},
  pages = 	 {647--655},
}



@book{Szabo,
    title   = {The Collected Papers of Gerhard Gentzen},
    year    = 1969,
    editor  = {Szabo, M.E.},
    publisher = {North-Holland},
    address = {Amsterdam}
}


# TTT #==================================================


@Article{Tarjan72,
  author =       {R. E. Tarjan},
  title =        {Depth First Search and Linear Graph Algorithms},
  journal =      SiamJC,
  volume =       {1},
  number =       {2},
  pages =        {146--160},
  month =        jun,
  year =         {1972}
}

@Article{TarjanYannakakis84,
  author =       {R. E. Tarjan and M. Yannakakis},
  title =        {Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs},
  journal =      SiamJC,
  volume =       {13},
  number =       {3},
  pages =        {566--579},
  year =         {1984}
}



@book {Tarjan83,
    author = {Tarjan, Robert Endre},
     title = {Data structures and network algorithms},
 publisher = SIAM,
   address = {Philadelphia, PA},
      year = {1983},
}


@article {Thomassen88,
    author = {Thomassen, Carsten},
     title = {On the presence of disjoint subgraphs of a specified type},
   journal = JGT,
    volume = {12},
      year = {1988},
    number = {1},
     pages = {101--111},
}


@article {Tovey84,
    author = {Tovey, Craig A.},
     title = {A simplified {N}{P}-complete satisfiability problem},
   journal = DAM,
    volume = {8},
      year = {1984},
    number = {1},
     pages = {85--89},
}




@book{Troelstra92,
    author  = {Anne Sjerp Troelstra},
    title   = {Lectures on Linear Logic},
    year    = {1992},
    publisher = {CSLI Leland Stanford Junior University},
    address = {Stanford},
    series  = {CSLI lecture notes 29}
}

@article {Truszczynski02,
    author = {Truszczy{\'n}ski, Miros{\l}aw},
     title = {Computing large and small stable models},
   journal = TPLP,
    volume = {2},
      year = {2002},
    number = {1},
     pages = {1--23},
}


@Book{Tsang93,
  author = 	 {Tsang, E. P. K.},
  title = 	 {Foundations of Constraint Satisfaction},
  publisher = 	 AcademicPress,
  year = 	 {1993},
}

@article{Tseitin,
    author  = {Tseitin, G. S.},
    title   = {Complexity of a Derivation in the Propositional Calculus},
    journal = {Zap. Nauchn. Sem. Leningrad Otd. Mat. Inst. Akad. Nauk SSSR},
    year    = {1968},
    volume  = {8},
    pages   = {23--41},
    note    = {English translation reprinted in \cite{Siekm83b}}
}

@book{Siekm83b,
    title   = {Automation of reasoning. Classical Papers on Computer Science 1967--1970},
    year    = {1983},
    editor  = {J{\"o}rg Siekmann and Graham Wrightson},
    publisher = Springer,
    volume  = {2}
}




@article{Tseitin68transl,
    author  = {Tseitin, G. S.},
    title   = {On the Complexity of  Derivation in Propositional Calculus},
    journal = {Zap. Nauchn. Sem. Leningrad Otd. Mat. Inst. Akad. Nauk SSSR},
    year    = {1968},
    volume  = {8},
    pages   = {23--41},
    note    = {Russian. English translation in 
               J. Siekmann and G. Wrightson (eds.) 
               \emph{Automation of Reasoning. Classical Papers on 
               Computer Science 1967--1970}, Springer Verlag, 466--483, 1983}
}



@article{Tseitin68,
    author  = {Tseitin, G. S.},
    title   = {Complexity of a Derivation in the Propositional Calculus},
    journal = {Zap. Nauchn. Sem. Leningrad Otd. Mat. Inst. Akad. Nauk SSSR},
    year    = {1968},
    volume  = {8},
    pages   = {23--41},
    note    = {Russian}
}





@article {Tutte47,
    author = {Tutte, W. T.},
     title = {The factorization of linear graphs},
   journal = JLMS,
    volume = {22},
      year = {1947},
     pages = {107--111}
}



@article {Tutte54,
    author = {Tutte, W. T.},
     title = {A short proof of the factor theorem for finite graphs},
   journal = CanJM,
    volume = {6},
      year = {1954},
     pages = {347--352}
}



# UUU #==================================================



@article{Urquhart95,
    author  = {Alasdair Urquhart},
    title   = {The Complexity of Propositional Proofs},
    journal = BSL,
    year    = {1995},
    month   = dec,
    volume  = {1},
    number  = {4},
    pages   = {425--467}
}

@unpublished{Urquhart96,
    author  = {Alasdair Urquhart},
    title   = {The Symmetry Rule in Propositional Logic},
    year    = {1996},
    month   = may,
    note    = {Extended Abstract}
}



@article {Urquhart99,
    author = {Urquhart, Alasdair},
     title = {The symmetry rule in propositional logic},
   journal = DAM,
    volume = {96/97},
      year = {1999},
     PAGES = {177--193},
}




@article {Urquhart98,
    author = {Urquhart, Alasdair},
     title = {The complexity of propositional proofs},
   journal = {Bull. Eur. Assoc. Theor. Comput. Sci. EATCS},
    volume = {64},
      year = {1998},
     pages = {128--138},
}
@article {Urquhar97,
    author = {Urquhart, Alasdair},
     title = {The graph constructions of {H}aj\'os and {O}re},
   journal = JGT,
    volume = {26},
      year = {1997},
    number = {4},
     pages = {211--215},
}

@article{Urquhar92,
    author = {Urquhart, Alasdair},
     title = {The relative complexity of resolution and cut-free {G}entzen
              systems},
   journal = AMAI,
    volume = {6},
      year = {1992},
    number = {1-3},
     pages = {157--168},
}
@incollection {Urquhart89,
    author = {Urquhart, Alasdair},
     title = {Complexity of proofs in classical propositional logic},
 booktitle = {Logic from computer science (Berkeley, CA, 1989)},
     pages = {597--608},
 publisher = Springer,
      year = {1992},
}


@article {Urquhart89a,
    author = {Urquhart, Alasdair},
     title = {The complexity of {G}entzen systems for propositional logic},
   journal = TCS,
    volume = {66},
      year = {1989},
    number = {1},
     pages = {87--97},
}

@article {Urquhart87,
    author = {Urquhart, Alasdair},
     title = {Hard examples for resolution},
   journal = JACM,
    volume = {34},
      year = {1987},
    number = {1},
     pages = {209--219},
}



# VVV #==================================================

@article {Valiant79a,
    author = {Valiant, L. G.},
     title = {The complexity of enumeration and reliability problems},
   journal = SiamJC,
    volume = {8},
      year = {1979},
    number = {3},
     pages = {410--421},
}
@article {Valiant79b,
    author = {Valiant, L. G.},
     title = {The complexity of computing the permanent},
   journal = TCS,
    volume = {8},
      year = {1979},
    number = {2},
     pages = {189--201},
}


@article {Vanherpe04,
    author = {Vanherpe, Jean-Marie},
     title = {Clique-width of partner-limited graphs},
   journal = DM,
    volume = {276},
      year = {2004},
    number = {1-3},
     pages = {363--374},
}

@article {VelevBryant03,
    author = {Velev, Miroslav N. and Bryant, Randal E.},
     title = {Effective use of {B}oolean satisfiability procedures in the
              formal verification of superscalar and {VLIW} microprocessors},
   journal = JSC, 
    volume = {35},
      year = {2003},
    number = {2},
     pages = {73--106},
}

@InProceedings{Villanger06,
  author = 	 {Y. Villanger},
  title = 	 {Improved exponential-time algorithms for treewidth and minimum fill-in},
  booktitle = 	 {Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN'06)},
  pages = 	 {800--811},
  year = 	 {2006},
  volume = 	 {3887},
  series = 	 LNCS,
  publisher =    Springer
}


# WWW #==================================================





@InProceedings{Walsh00,
  author = 	 {Toby Walsh},
  title = 	 {{SAT} v {CSP}},
  booktitle = 	 {6th International Conferenc on Principles and 
                  Practice of Constraint Programming (CP 2000)},
  pages = 	 {441--456},
  year = 	 {2000},
  editor = 	 {R. Dechter},
  volume = 	 {1894},
  series = 	 LNCS,
  publisher =    Springer,
}


@article {Wanke94,
    author = {Wanke, Egon},
     title = {{$k$}-{NLC} graphs and polynomial algorithms},
      note = {Efficient algorithms and partial $k$-trees},
   journal = DAM,
    volume = {54},
      year = {1994},
    number = {2-3},
     pages = {251--266},
}


@Article{Weld99,
  author = 	 {Daniel S. Weld},
  title = 	 {Recent Advances in {AI} Planning},
  journal = 	 {AI Magazine},
  year = 	 {1999},
  volume = 	 {20},
  number = 	 {2},
  pages = 	 {93--123},
}

@Article{Whitehead89,
  author = 	 {C. Whitehead},
  title = 	 {Alternating cycles in edge-colored graphs},
  journal = 	 JGT,
  year = 	 {1989},
  volume = 	 {13},
  number = 	 {4},
  pages = 	 {387--391}
}





@InProceedings{WilliamsGomesSelman03,
  author = 	 {Ryan Williams and Carla Gomes and Bart Selman},
  title = 	 {Backdoors To Typical Case Complexity},
  booktitle = 	 {Proceedings of the Eighteenth International 
                  Joint Conference on Artificial Intelligence, IJCAI 2003},
  year = 	 {2003},
  pages =        {1173--1178},
  publisher = MC,
  editor    = {Georg Gottlob and
               Toby Walsh},
 }



@InProceedings{WilliamsGomesSelman03a,
  author = 	 {Ryan Williams and Carla Gomes and Bart Selman},
  title = 	 {On the connections between backdoors, restarts, 
                  and heavy-tailedness in combinatorial search},
  booktitle = 	 {Informal Proc. of the 
                  Sixth International Conference on Theory and 
                  Applications of Satisfiability Testing, 
                  S. Margherita Ligure - Portofino, Italy, 
                  May 5-8, 2003 (SAT 2003)},
  pages =        {222--230},
  year = 	 {2003},
 }


@InProceedings{Woeginger03,
  author    = {Gerhard J. Woeginger},
  title     = {Exact Algorithms for {NP}-Hard Problems: A Survey.},
  booktitle = {Combinatorial Optimization - Eureka, You Shrink!, Papers
               Dedicated to Jack Edmonds, 5th International Workshop, Aussois,
               France, March 5-9, 2001, Revised Papers},
  year      = {2003},
  pages     = {185-208},
  series    = LNCS,
  volume    = {2570},
}

# XXX #==================================================


# YYY #==================================================

@article {YamasakiDoshita83,
    author = {Yamasaki, Susumu and Doshita, Shuji},
     title = {The satisfiability problem for a class consisting of {H}orn
              sentences and some non-{H}orn sentences in proportional
              logic},
   journal = IC,
    volume = {59},
      year = {1983},
    number = {1-3},
     pages = {1--12},
}





@InProceedings{Yannakakis81,
  author = 	 {Mihalis Yannakakis},
  title = 	 {Algorithms for acyclic database schemes},
  booktitle = 	 {Very Large Data Bases, 7th International Conference, 
                  Sep. 9--11, 1981, Cannes, France, Proceedings},
  pages = 	 {81--94},
  year = 	 {1981},
  editor = 	 {C. Zaniolo and C. Delobel},
  publisher =    {IEEE Computer Society},
}

@Article{Yeo97,
  author = 	 {Anders Yeo},
  title = 	 {A note on alternating cycles in edge-coloured graphs},
  journal = 	 JCombTB,
  year = 	 {1997},
  volume = 	 {69},
  number =       {2},
  pages = 	 {222-225}
}


@Article {Yu93,
    author = {Yu, Qing Lin},
     title = {Characterizations of various matching extensions in graphs},
   journal = AAJC,
    volume = {7},
      year = {1993},
     pages = {55--64},
}




# ZZZ #==================================================





@InProceedings{ZhangMalik02,
  author = 	 {Lintao Zhang and Sharad Malik},
  title = 	 {The Quest for Efficient Boolean Satisfiability Solvers},
  booktitle =    {Computer Aided Verification:
                 14th International  Conference (CAV 2002)},
  pages = 	 {17--36},
  year = 	 {2002},
  editor = 	 {D. Brinksma and K. G. Larsen},
  volume = 	 {2404},
  series = 	 LNCS,
}

@article {ZhangStickel00,
    author = {Zhang, Hantao and Stickel, Mark},
     title = {Implementing the {D}avis-{P}utnam method},
   journal = JAR,
    volume = 24,
      year = 2000,
    number = {1-2},
     pages = {277--296},
}



@Article{ZhaoDing99,
  author = 	 {Zhao, Xinshun and Ding, Decheng},
  title = 	 {Two tractable subclasses of minimal unsatisfiable formulas},
  journal = 	 ScienceInChinaA,
  year = 	 {1999},
  volume = 	 {42},
  number = 	 {7},
  pages = 	 {720--731},
}



% EGCC





@article {Cornuejols88,
    author = {Cornu{\'e}jols, G{\'e}rard},
     title = {General factors of graphs},
   journal = JCombTB,
    volume = {45},
      year = {1988},
    number = {2},
     pages = {185--198},
}


@article {Lovasz72,
    author = {Lov{\'a}sz, L.},
     title = {The factorization of graphs. {II}},
   journal = {Acta Math. Acad. Sci. Hungar.},
    volume = {23},
      year = {1972},
     pages = {223--246},
}

@incollection {Lovasz70,
    author = {Lov{\'a}sz, L.},
     title = {The factorization of graphs},
 booktitle = {Combinatorial Structures and their Applications (Proc. Calgary
              Internat. Conf., Calgary, Alta., 1969)},
     pages = {243--246},
 publisher = {Gordon and Breach},
   address = {New York},
      year = {1970},
}



@Book{RossiVanBeekWalsh06,
  editor = 	 {F. Rossi and P. van Beek and T. Walsh},
  title = 	 {Handbook of Constraint Programming},
  publisher =    {Elsevier},
  year = 	 {2006},
}




@InCollection{HoeveKatriel06,
  author = 	 {W.-J. van Hoeve and Irit Katriel},
  title = 	 {Global Constraints},
  booktitle = 	 {Handbook of Constraint Programming},
  publisher =    {Elsevier},
  year = 	 {2006},
  editor = 	 {F. Rossi and P. van Beek and T. Walsh},
  chapter = 	 {6},
}


@InCollection{Dechter06a,
  author = 	 {R. Dechter},
  title = 	 {Tractable Structures for {CSPs}},
  booktitle = 	 {Handbook of Constraint Programming},
  publisher =    {Elsevier},
  year = 	 {2006},
  editor = 	 {F. Rossi and P. van Beek and T. Walsh},
  chapter = 	 {7},
}




@TechReport{BeldiceanuCarlssonRampon06,
  author = 	 {N. Beldiceanu and Mats Carlsson and J.-X. Rampon},
  title = 	 {Global Constraint Catalog},
  institution =  {SICS},
  year = 	 {2006},
  number = 	 {T2005:08},
  address = 	 {SE-16 429 Kista, Sweden},
  month = 	 AUG,
  note = 	 {On-line version at \url{http://www.emn.fr/x-info/sdemasse/gccat/}},
}



@InProceedings{BourdaisGalinierPesant03,
  author = 	 {S. Bourdais and P. Galinier and G. Pesant},
  title = 	 {{HIBISCUS:} A Constraint Programming Application 
                 to Staff Scheduling in Health Care},
  booktitle =    {Principles and Practice of Constraint Programming (CP 2003)},
  pages = 	 {153--167},
  year = 	 {2003},
  editor = 	 {F. Rossi},
  volume = 	 {2833},
  series = 	 LNCS,
  publisher =    Springer,
}



@InProceedings{ReginGomes04,
  author = 	 {J.-C. R\'{e}gin and C. Gomes},
  title = 	 {The Cardinality Matrix Constraint},
  booktitle =    {Principles and Practice of Constraint Programming (CP 2004)},
  pages = 	 {572--587},
  year = 	 {2004},
  editor = 	 {M. Wallace},
  volume = 	 {3258},
  series = 	 LNCS,
  publisher =    Springer,
}

@InProceedings{BessiereHebrardHnichWalsh04,
  author = 	 {C. Bessi\'{e}re and  E. Hebrard and B. Hnich and  T. Walsh},
  title = 	 {The Tractability of Global Constraints},
  booktitle =    {Principles and Practice of Constraint Programming (CP 2004)},
  pages = 	 {716--720},
  year = 	 {2004},
  editor = 	 {M. Wallace},
  volume = 	 {3258},
  series = 	 LNCS,
  publisher =    Springer,
}




@InProceedings{Regin96,
  author = 	 {J.-C. R\'{e}gin},
  title = 	 {Generalized Arc Consistency for 
                  Global Cardinality Constraint},
  booktitle =   {14th National Conference on 
                 Artificial Intelligence (AAAI 1996)},
  pages = 	 {209--215},
  year = 	 {1996},
  volume = 	 {1},
  publisher = {AAAI Press / The MIT Press},
}


@InProceedings{QuimperLopezortizVanbeekGolynski04,
  author = 	 {C.-G. Quimper and A. L\'{o}pez-Ortiz and P. van Beek and 
                  A. Golynski},
  title = 	 {Improved Algorithms for the Global Cardinality Constraint},
  booktitle =    {Principles and Practice of Constraint Programming (CP 2004)},
  pages = 	 {542--556},
  year = 	 {2004},
  editor = 	 {M. Wallace},
  volume = 	 {3258},
  series = 	 LNCS,
  publisher =    Springer,
}



@InProceedings{Sellmann03,
  author = 	 {M. Sellmann},
  title = 	 {Cost-Based Filtering for Shorter Path Constraints},
  booktitle =    {Principles and Practice of Constraint Programming (CP 2003)},
  pages = 	 {694--708},
  year = 	 {2003},
  editor = 	 {F. Rossi},
  volume = 	 {2833},
  series = 	 LNCS,
  publisher =    Springer,
}




@Article{Bodlaender93a,
  author = 	 {Hans Bodlaender},
  title = 	 {A tourist guide through treewidth},
  journal = 	 ActaCyb,
  year = 	 {1993},
  volume = 	 {11},
  number = 	 {1-2},
  pages = 	 {1--22},
}


@inProceedings{GottlobPichlerWei06, 
author    = {Georg Gottlob and
               Reinhard Pichler and
               Fang Wei},
  title =   {Bounded Treewidth as a Key to Tractability of 
             Knowledge Representation and Reasoning}, 
  booktitle     = {21st National Conference on 
                Artificial
               Intelligence and the 18th Innovative Applications
               of Artificial Intelligence Conference},
  publisher = {AAAI Press},
  year      = {2006},
}



@Book{Kloks94,
  author = 	 {T. Kloks},
  title = 	 {Treewidth: Computations and Approximations},
  publisher = 	 Springer,
  address = {Berlin},
  year = 	 {1994},
}


@article {AspvallProskurowskiTelle00,
    author = {Aspvall, B. and Proskurowski, A. and Telle, J. A.},
     title = {Memory requirements for table computations in partial
              {$k$}-tree algorithms},
   journal = Alg,
    volume = {27},
      year = {2000},
    number = {3-4},
     pages = {382--394},
}

% BICLIQUES


@article {AmilhastreVilaremJanssen98,
    author = {Amilhastre, J. and Vilarem, M. C. and Janssen, P.},
     title = {Complexity of minimum biclique cover and minimum biclique
              decomposition for bipartite domino-free graphs},
   journal = DAM,
    volume = {86},
      year = {1998},
    number = {2-3},
     pages = {125--144},
}	


@article {CornazDenisFonlupt06,
    author = {Cornaz, Denis and Fonlupt, Jean},
     title = {Chromatic characterization of biclique covers},
   journal = DM,
    volume = {306},
      year = {2006},
    number = {5},
     pages = {495--507},
}




@Article{DantasDeFigueiredoGravierKlein05,
  author = 	 {Simone Dantas and Celina M.H. {de Figueiredo}
                  and Sylvain Gravier and Sulamita Klein},
  title = 	 {Finding {H}-partitions efficiently},
  journal = 	 {RAIRO - Theoretical Informatics and Applications},
  year = 	 {2005},
  volume = 	 {39},
  number = 	 {1},
  pages = 	 {133--144},
}


@inproceedings{HeydariMoralesShieldsSudborough07,
  author    = {Mohammad Hossain Heydari and
               Linda Morales and
               C. O. {Shields Jr.} and
               Ivan Hal Sudborough},
  title     = {Computing Cross Associations for Attack Graphs and Other
               Applications},
  booktitle = {40th Hawaii International International Conference on Systems
               Science (HICSS-40 2007),
               3-6 January 2007,  Waikoloa, Big Island, HI, USA},
  year      = {2007},
  pages     = {270},
}



@article {Orlin77,
    author = {Orlin, James},
     title = {Contentment in graph theory: covering graphs with cliques},
   journal = {Nederl. Akad. Wetensch. Proc. Ser. A  80, Indag. Math.},
    volume = 39,
      year = 1977,
    number = 5,
     pages = {406--424},
}
	
 
@article {Muller96,
    author = {M{\"u}ller, Haiko},
     title = {On edge perfectness and classes of bipartite graphs},
   journal = DM,
    volume = {149},
      year = {1996},
    number = {1-3},
     pages = {159--187},
}


@article{HuffnerNiedermeierWernicke08,
   author = {F. H\"{u}ffner and R. Niedermeier and S. Wernicke},
   title =  {Techniques for practical fixed-parameter algorithms},
   journal = TCJ,
   volume    = {51},
  number    = {1},
  year      = {2008},
  pages     = {7--25},
}


@ARTICLE{GrammGuoHuffnerNiedermeier06,
   author = {J. Gramm and J. Guo and F. H\"{u}ffner and  R. Niedermeier},
   title = {Data reduction, exact, and heuristic algorithms for clique cover},
   journal = {In Proc. ALENEX'06, SIAM},
   year = 2006,
   pages = {86--94},
}  

@article {GravierKoblerKubiak02,
    author = {Gravier, Sylvain and Kobler, Daniel and Kubiak, Wieslaw},
     title = {Complexity of list coloring problems with a fixed total number
              of colors},
   journal = DAM,
    volume = {117},
      year = {2002},
    number = {1-3},
     pages = {65--79},
}

@book {ChartrandLesniak05,
    author = {Chartrand, G. and Lesniak, L.},
     title = {Graphs \& digraphs},
   edition = {Fourth},
 publisher = {Chapman \& Hall/CRC, Boca Raton, FL},
      year = {2005},
}


@article {HabibPaul05,
    author = {Habib, Michel and Paul, Christophe},
     title = {A simple linear time algorithm for cograph recognition},
   journal = DAM,
    volume = {145},
      year = {2005},
    number = {2},
     pages = {183--197},
}
    

@article {CorneilPerlStewart85,
    author = {Corneil, D. G. and Perl, Y. and Stewart, L. K.},
     title = {A linear recognition algorithm for cographs},
   journal = SiamJC,
    volume = {14},
      year = {1985},
    number = {4},
     pages = {926--934},
}


@article {Seinsche74,
    author = {Seinsche, D.},
     title = {On a property of the class of {$n$}-colorable graphs},
   journal = JCombTB,
    volume = {16},
      year = {1974},
     pages = {191--193},
}

@article {Kundgen98,
    author = {K{\"u}ndgen, Andr{\'e}},
     title = {Covering cliques with spanning bicliques},
   journal = JGT,
    volume = {27},
      year = {1998},
    number = {4},
     pages = {223--227},
}

@article {Vikas02,
    author = {Vikas, Narayan},
     title = {Computational complexity of compaction to reflexive cycles},
   journal = SiamJC,
    volume = {32},
      year = {2002/03},
    number = {1},
     pages = {253--280},
} 

% SymCon

@article {Schoening88,
    title = {Graph Isomorphism is in the Low Hierarchy},
    author = {Sch{\"o}ning, Uwe},
    journal = JCSS,
    year = {1988},
    volume = {37},
    pages = {312--323},
}

% CP

@article{BidyukDechter07,
  author    = {Bozhena Bidyuk and
               Rina Dechter},
  title     = {Cutset Sampling for {Bayesian} Networks},
  journal   = JAIR,
  volume    = {28},
  year      = {2007},
  pages     = {1--48},
}



@Book{AbiteboulHullVianu95,
  author = 	 {S. Abiteboul and R. Hull and V. Vianu},
  title = 	 {Foundations of Databases},
  publisher = 	 {Addison-Wesley},
  year = 	 {1995},
}




% matchbds

@inproceedings{DilkinaGomesSabharwal07,
  author    = {Bistra N. Dilkina and
               Carla P. Gomes and
               Ashish Sabharwal},
  title     = {Tradeoffs in the Complexity of Backdoor Detection},
  booktitle = {Principles and Practice of Constraint Programming - CP 2007,
               13th International Conference, CP 2007, Providence, RI,
               USA, September 23-27, 2007, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4741},
  year      = {2007},
  pages     = {256--270},
}


@Article{KleineBuningZhao07,
  author = 	 {Hans {Kleine B\"{u}ning} and Xishun Zhao},
  title = 	 {An Extension of Deficiency and Minimal Unsatisfiability 
                  of Quantified Boolean Formulas},
  journal = 	 JSAT,
  year = 	 {2007},
  volume = 	 {3},
  pages = 	 {115--123},
}




@TechReport{Kullmann07,
  author = 	 {Oliver Kullmann},
  title = 	 {Constraint satisfaction problems in clausal form:
                  Autarkies and minimal unsatisfiability},
  institution =  {University of Wales Swansea},
  year = 	 {2007},
  number = 	 {CSR 8-2007},
}

% SAT handbook

@Unpublished{DantchevSzeider07,
  author = 	 {Stefan Dantchev and Stefan Szeider},
  title = 	 {Some observations on parameterized satisfiability},
  note = 	 {Unpublished Manuscrip},
  year = 	 {2007},
}

@Unpublished{FellowsSzeider2006,
  author = 	 {Michael R. fellows and Stefan Szeider},
  title = 	 {On {2SAT} deletion and related problems},
  note = 	 {Unpublished Manuscrip},
  year = 	 {2006},
}


% backdoor trees

@inproceedings{DilkinaGomesSabharwal08,
  author    = {Bistra N. Dilkina and
               Carla P. Gomes and
               Ashish Sabharwal},
  title     = {Tradeoffs in Backdoor Detection for {Sat} and {Unsat} Formulas},
  booktitle = {The Tenth International Symposium on
               Artificial Intelligence and Mathematics,
        	Fort Lauderdale, Florida,
              January 2-4, 2008},
  year      = {2008},
  pages     = {256--270},
}



 @TechReport{DemaineEtal07,
  author = 	 {Demaine, Erik and Gutin, Gregory Z. and Marx, Daniel and Stege, Ulrike},
  title = 	 {Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs},
  institution =  {Schloss Dagstuhl},
  year = 	 {2007},
  note = 	 {\url{http://drops.dagstuhl.de/portals/index.php?semnr=07281}},

}


@Book{Vazirani01,
  author = 	 {Vijay V. Vazirani},
  title = 	 {Approximation Algorithms},
  publisher = 	 Springer,
  year = 	 {2001},
}

@article{SinzKaiserKuechlin03,
  author = {Carsten Sinz and Andreas Kaiser and Wolfgang K{\"u}chlin},
  title = {Formal Methods for the Validation of Automotive Product
		Configuration Data},
  journal = {Artificial Intelligence for Engineering Design,
		Analysis and Manufacturing},
  volume = {17},
  number = {1},
  pages = {75--97},
  year = {2003},
}


% MSO and  ICDM


@Article{Makowsky04,
  author = 	 {J. A. Makowsky},
  title = 	 {Algorithmic uses of the {F}eferman-{V}aught {T}heorem},
  journal = 	 APAL,
  year = 	 {2004},
  volume = 	 {126},
  pages = 	 {159--213},
}

@InCollection{Grohe07a,
  author = 	 {Martin Grohe},
  title = 	 {Logic, graphs, and algorithms},
  booktitle = 	 {Logic and Automata: History and Perspectives},
  pages = 	 {357--422},
  publisher =   {Amsterdam University Press},
  year = 	 {2007},
  editor = 	 {J. Flum and  E. Gr\"{a}del and T.Wilke},
  volume = 	 {2},
  series = 	 {Texts in Logic and Games},
}



@article {ThatcherWright68,
    author = {Thatcher, J. W. and Wright, J. B.},
     title = {Generalized finite automata theory with an application to a
              decision problem of second-order logic},
   journal = {Math. Systems Theory},
    volume = {2},
      year = {1968},
     pages = {57--81},
}

@article {ArnborgLagergrenSeese91,
    author = {Arnborg, Stefan and Lagergren, Jens and Seese, Detlef},
     title = {Easy problems for tree-decomposable graphs},
   journal = JAlg,
    volume = {12},
      year = {1991},
    number = {2},
     pages = {308--340},
}




@article {Meyer73,
    author = {Meyer, Walter},
     title = {Equitable coloring},
   journal = AMM,
    volume = {80},
      year = {1973},
     pages = {920--922},
}

@incollection {Lih98,
    author = {Lih, Ko-Wei},
     title = {The equitable coloring of graphs},
 booktitle = {Handbook of combinatorial optimization, Vol.\ 3},
     pages = {543--566},
 publisher = Kluwer,
   address = {Boston, MA},
      year = {1998},
}

@article {BodlaenderFomin05,
    author = {Bodlaender, Hans L. and Fomin, Fedor V.},
     title = {Equitable colorings of bounded treewidth graphs},
   journal = TCS,
    volume = {349},
      year = {2005},
    number = {1},
     pages = {22--30},
}


@inproceedings{BodlaenderFomin04,
  author    = {Hans L. Bodlaender and
               Fedor V. Fomin},
  title     = {Equitable Colorings of Bounded Treewidth Graphs},
  booktitle = {proceedings of MFCS 2004,  29th
               International Symposium on Mathematical 
               Foundations of Computer Science, Prague, Czech Republic,
               August 22-27, 2004},
  year      = {2004},
  pages     = {180-190},
  publisher = Springer,
  series    = LNCS,
  volume    = {3153},
  note       ={Full version published in 
              \emph{Theoret. Comput. Sci.} 349(1), pp.~22--30, 2005.},
}


@InProceedings{AsahiroMiyanoOno08,
  author = 	 {Yuichi Asahiro and Eiji Miyano and Hirotaka Ono},
  title = 	 {Graph Classes and the Complexity of the Graph Orientation
                  Minimizing the Maximum Weighted Outdegree},
  booktitle = {Proceedings of CATS 2008, Computing: The Australasian Theory
                  Symposium, University of Wollongong, New South Wales,
                  Australia, January 22-25, 2008, part of the Australasian
                  Computer Society Week (ACSW 2008)},
  pages = 	 {97--106},
  year = 	 {2008},
  editor = 	 {J. Harland and P. Manyem},
  volume = 	 {77},
  series = 	 {Conferences in Research and Practice in Information
                  Technology},
  address =      {Sydney},
  publisher =    {Australian Computer Society},
}

@incollection {Courcelle90,
    author = {Courcelle, Bruno},
     title = {Graph rewriting: an algebraic and logic approach},
 booktitle = {Handbook of theoretical computer science, Vol.\ B},
     pages = {193--242},
 publisher = Elsevier,
   address = {Amsterdam},
      year = {1990},
}

@article {Rose74,
    author = {Rose, Donald J.},
     title = {On simple characterizations of {$k$}-trees},
   journal = DM,
    volume = {7},
      year = {1974},
     pages = {317--322},
}

@article {KostochkaNakprasitPemmaraju05,
    author = {Kostochka, A. V. and Nakprasit, K. and Pemmaraju, S. V.},
     title = {On equitable coloring of {$d$}-degenerate graphs},
   journal = SiamJDM,
    volume = {19},
      year = {2005},
    number = {1},
     pages = {83--95},
}


@book {JensenToft95,
    author = {Jensen, Tommy R. and Toft, Bjarne},
     title = {Graph coloring problems},
    series = {Wiley-Interscience Series in Discrete Mathematics and
              Optimization},
 publisher = Wiley,
   address = {New York},
      year = {1995},
}



@incollection {Woodall01,
    author = {Woodall, Douglas R.},
     title = {List colourings of graphs},
 booktitle = {Surveys in combinatorics, 2001 (Sussex)},
    series = {London Math. Soc. Lecture Note Ser.},
    volume = {288},
     pages = {269--301},
 publisher = CamUP,
      year = {2001},
}
@article {Tuza97,
    author = {Tuza, Zsolt},
     title = {Graph colorings with local constraints---a survey},
   JOURNAL = DMGT,
    VOLUME = {17},
      YEAR = {1997},
    NUMBER = {2},
     PAGES = {161--228},
}

@incollection {FialaGolovachKratochvi05,
    author = {Fiala, Ji{\v{r}}{\'{\i}} and Golovach, Petr A. and
              Kratochv{\'{\i}}l, Jan},
     title = {Distance constrained labelings of graphs of bounded treewidth},
 booktitle = {Automata, languages and programming},
    series = LNCS,
    volume = {3580},
     pages = {360--372},
 publisher = Springer,
      year = {2005},
}

@article {GareyGrahamJohnsonKnuth78,
    author = {Garey, M. R. and Graham, R. L. and Johnson, D. S. and Knuth,
              D. E.},
     title = {Complexity results for bandwidth minimization},
   journal = SiamJAM,
    volume = {34},
      year = {1978},
    number = {3},
     pages = {477--495},
}



@Unpublished{FellowsHermelinRosamond07,
  author = 	 {Michael R. Fellows and  Danny Hermelin 
                 and Frances A. Rosamond},
  title = 	 {On the Fixed-Parameter Intractability and Tractability 
                  of Multiple-Interval Graph Problems},
  note = 	 {Manuscript},
  year = 	 {2007},
}

@article {Pietrzak03,
    author = {Pietrzak, Krzysztof},
     title = {On the parameterized complexity of the fixed alphabet shortest
              common supersequence and longest common subsequence problems},
   journal = JCSS,
    volume = {67},
      year = {2003},
    number = {4},
     pages = {757--771},
}
	



% QBF-MSO proposal

@article {Buchi60,
    author = {B{\"u}chi, J. Richard},
     title = {Weak second-order arithmetic and finite automata},
   journal = ZMLGM,
    volume = {6},
      year = {1960},
     pages = {66--92},
}


@article{GenevesLayaida07,
  author    = {Pierre Genev{\`e}s and
               Nabil Laya\"{\i}da},
  title     = {Deciding XPath containment with MSO},
  journal   = DKE,
  volume    = {63},
  number    = {1},
  year      = {2007},
  pages     = {108--136},
}



@inproceedings{InabaHosoya07,
  author    = {Kazuhiro Inaba and
               Haruo Hosoya},
  title     = {{XML} Transformation Language Based on Monadic Second Order
               Logic},
  booktitle = {PLAN-X,  Programming Language Technologies for XML,
               An ACM SIGPLAN Workshop colocated with POPL 2007, Nice,
               France, January 20, 2007},
  year      = {2007},
  pages     = {49-60},
}


@Manual{KlarlundMoller01,
  author =       {Nils Klarlund and Anders M{\o}ller},
  title =        {{MONA Version 1.4 User Manual}},
  organization = {BRICS, Department of Computer Science, University of Aarhus},
  month =        {January},
  year =         {2001},
  note =         {Notes Series NS-01-1.
                  Available from \url{http://www.brics.dk/mona/}. 
                  Revision of BRICS NS-98-3}
}


@inproceedings{JensenJorgensenKlarlundSchwartzbach97,
  author    = {Jakob L. Jensen and
               Michael E. J{\o}rgensen and
               Nils Klarlund and
               Michael I. Schwartzbach},
  title     = {Automatic Verification of Pointer Programs using Monadic
               Second-Order Logic},
  booktitle = {Proceedings of the ACM SIGPLAN '97 
               Conference on Programming Language Design and 
               Implementation (PLDI), Las Vegas, Nevada, 15-18 June 1997, 
               SIGPLAN Notices 32(5)},
  year      = {1997},
  pages     = {226--236},
}

@inproceedings{BasinKlarlund95,
  author    = {David A. Basin and
               Nils Klarlund},
  title     = {Hardware Verification using Monadic Second-Order Logic},
  booktitle = {Computer Aided Verification, 7th International Conference,
               Li{\`e}ge, Belgium, July, 3-5, 1995, Proceedings},
  pages     = {31--41},
  publisher = Springer,
  series    = LNCS,
  volume    = {939},
  year      = {1995},
}

@article {KlarlundMollerSchwartzbach02,
    author = {Klarlund, Nils and M{\o}ller, Anders and Schwartzbach, Michael
              I.},
     title = {Mona implementation secrets},
   journal = IJFCS,
    volume = {13},
      year = {2002},
    number = {4},
     pages = {571--586},
}

@inproceedings{CrawfordGinsbergLuksRoy96,
  author    = {James M. Crawford and
               Matthew L. Ginsberg and
               Eugene M. Luks and
               Amitabha Roy},
  title     = {Symmetry-Breaking Predicates for Search Problems},
  editor =    {Luigia Carlucci Aiello, Jon Doyle, Stuart C. Shapiro},
  booktitle = {Proceedings of the Fifth International Conference on 
               Principles of Knowledge Representation and Reasoning (KR'96), 
               Cambridge, Massachusetts, USA, November 5-8, 1996},
  publisher = MC,
  year      = {1996},
  pages     = {148--159},
}




@InCollection{GentPetriePuget06,
  author = 	 {Ian P. Gent and Karen E. Petrie and Jean-Francois Puget},
  title = 	 {Symmetry in Constraint Programming},
  booktitle = 	 {Handbook of Constraint Programming},
  publisher = {Elsevier},
  year = 	 {2006},
  editor = 	 {Francesca Rossi and Peter van Beek and Toby Walsh},
  volume = 	 {I},
  chapter = 	 {10},
}


@inproceedings{AudemardJabbourSais07,
  author    = {Gilles Audemard and
               Sa\"{\i}d Jabbour and
               Lakhdar Sais},
  title     = {Symmetry Breaking in Quantified Boolean Formulae},
  booktitle = {IJCAI 2007, Proceedings of the 20th International Joint
               Conference on Artificial Intelligence, Hyderabad, India,
               January 6-12, 2007},
  editor    = {Manuela M. Veloso},
  year      = {2007},
  pages     = {2262--2267},
}


@inproceedings{GongXu06,
  author    = {Ping Gong and
               Daoyun Xu},
  title     = {A New Lower Bound of Critical Function for (k, s)-SAT},
  booktitle = {Theory and Applications of Models of Computation, Third
               International Conference, TAMC 2006, Beijing, China, May
               15-20, 2006, Proceedings},
  publisher = Springer,
  series    = LNCS},
  volume    = {3959}
  year      = {2006},
  pages     = {274--282},
}


% fellowship proposal

@article {KhullerBhatiaPless03,
    author = {Khuller, Samir and Bhatia, Randeep and Pless, Robert},
     title = {On local search and placement of meters in networks},
   journal = SiamJC,
    volume = {32},
      year = {2003},
    number = {2},
     pages = {470--487},
}


@inproceedings{Fellows05,
  author    = {Michael R. Fellows},
  title     = {New Directions and New Challenges in Algorithm Design and
               Complexity, Parameterized},
  booktitle = {Algorithms and Data Structures, 8th International Workshop,
               WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1,
               2003, Proceedings},
  year      = {2003},
  pages     = {505--520},
  publisher = Springer,
  series    = LNCS,
  volume    = {2748},
  year      = {2003},
}


@inproceedings{KrokhinMarx08,
  author    = {Andrei A. Krokhin and
               D{\'a}niel Marx},
  title     = {On the Hardness of Losing Weight},
  booktitle = {Automata, Languages and Programming, 35th International
               Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008,
               Proceedings, Part I: Track A: Algorithms, Automata, Complexity,
               and Games},
  year      = {2008},
  pages     = {662--673},
  publisher = Springer,
  series    = LNCS,
  volume    = {5125},
}





@article {Marx08,
    author = {Marx, D{\'a}niel},
     title = {Searching the {$k$}-change neighborhood for {TSP} is
              {W}[1]-hard},
   journal = ORL,
    volume = {36},
      year = {2008},
    number = {1},
     pages = {31--36},
}
	
@article {Bixby02,
    author = {Bixby, Robert E.},
     title = {Solving real-world linear programs: a decade and more of
              progress},
      note = {50th anniversary issue of Operations Research},
   journal = OR,
    volume = {50},
      year = {2002},
    number = {1},
     pages = {3--15},
}
		

@inproceedings{Fellows06,
  author    = {Michael R. Fellows},
  title     = {The Lost Continent of Polynomial Time: Preprocessing and
               Kernelization},
  booktitle = {Parameterized and Exact Computation, Second International
               Workshop, IWPEC 2006, Z{\"u}rich, Switzerland, September
               13-15, 2006, Proceedings},
  pages     = {276--277},
  publisher = Springer,
  series    = LNCS,
  volume    = {4169},
  year      = {2006},
}


@inproceedings{BessiereEtal08,
  author    = {Christian Bessi{\`e}re and
               Emmanuel Hebrard and
               Brahim Hnich and
               Zeynep Kiziltan and
               Claude-Guy Quimper and
               Toby Walsh},
  title     = {The Parameterized Complexity of Global Constraints},
  booktitle = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,
               2008},
  year      = {2008},
  pages     = {235--240},
  publisher = {AAAI Press},
}


@inproceedings{Gao08,
  author    = {Yong Gao},
  title     = {Phase Transitions and Complexity of Weighted Satisfiability
               and Other Intractable Parameterized Problems},
  booktitle = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,
               2008},
  year      = {2008},
  pages     = {265--270},
  publisher = {AAAI Press},
  year      = {2008},
}




@Article{Koriche08,
  author = 	 {F. Koriche},
  title = 	 {Learning to assign degrees of belief in relational domains},
  journal = 	 ML,
  year = 	 {2008},
  volume = 	 {73},
  number = 	 {2},
  pages = 	 {25--53},
}

@inproceedings{BodlaenderDowneyFellowsHermelin08,
  author    = {Hans L. Bodlaender and
               Rodney G. Downey and
               Michael R. Fellows and
               Danny Hermelin},
  title     =  {On Problems without Polynomial Kernels (Extended Abstract)},
  booktitle     = {Automata, Languages and Programming, 35th International
               Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008,
               Proceedings, Part I: Tack A: Algorithms, Automata, Complexity,
               and Games},
  pages     = {563--574},
  publisher = Springer,
  series    = LNCS,
  volume    = {5125},
  year      = {2008},
}



@inproceedings{CebrianEtal08,
  author    = {Manuel Cebri{\'a}n and
               Iv{\'a}n Dot{\'u} and
               Pascal Van Hentenryck and
               Peter Clote},
title     = {Protein Structure Prediction on the Face Centered Cubic
               Lattice by Local Search},
booktitle     = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,
               2008},
pages     = {241--246},
  publisher = {AAAI Press},
  year      = {2008},
}


@inproceedings{Zivan08,
  author    = {Roie Zivan},
  title     = {Anytime Local Search for Distributed Constraint Optimization},
  pages     = {393--398},
  booktitle     = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,
               2008},
  publisher = {AAAI Press},
  year      = {2008},
}

@inproceedings{PhamThorntonSattar08,
  author    = {Duc Nghia Pham and
               John Thornton and
               Abdul Sattar},
  title     = {Efficiently Exploiting Dependencies in Local Search for
               SAT},
  year      = {2008},
  pages     = {1476--1478},
  booktitle     = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,
               2008},
  publisher = {AAAI Press},
}

@inproceedings{MorrisEtAl08,
  author    = {Robert A. Morris and
               John Gasch and
               Lina Khatib and
               Steven Covington},
  title     = {Local Search for Optimal Global Map Generation Using Mid-Decadal
               Landsat Images},
  year      = {2008},
  pages     = {1706--1711},
  booktitle     = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,
               2008},
  publisher = {AAAI Press},
}


@inproceedings{SamulowitzDaviesBacchus06,
  author    = {Horst Samulowitz and
               Jessica Davies and
               Fahiem Bacchus},
  title     = {Preprocessing QBF},
  pages     = {514--29},
  booktitle     = {Principles and Practice of Constraint Programming - CP 2006,
               12th International Conference, CP 2006, Nantes, France,
               September 25-29, 2006, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4204},
  year      = {2006},
}

@inproceedings{KoshimuraUmedaHasegawa04,
  author    = {Miyuki Koshimura and
               Mayumi Umeda and
               Ryuzo Hasegawa},
  title     = {Abstract Model Generation for Preprocessing Clause Sets},
  pages     = {67--78},
  booktitle     = {Logic for Programming, Artificial Intelligence, and Reasoning,
               11th International Conference, LPAR 2004, Montevideo, Uruguay,
               March 14-18, 2005 (sic!), Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3452},
  year      = {2005},
  isbn      = {3-540-25236-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@inproceedings{MoraEtal03,
  author    = {Angel Mora and
               Manuel Enciso and
               Pablo Cordero and
               Inmaculada Perez de Guzm{\'a}n},
  title     = {An Efficient Preprocessing Transformation for Functional
               Dependencies Sets Based on the Substitution Paradigm},
  pages     = {136--146},
  booktitle     = {Current Topics in Artificial Intelligence, 10th Conference
               of the Spanish Association for Artificial Intelligence,
               CAEPIA 2003, and 5th Conference on Technology Transfer,
               TTIA 2003, San Sebastian, Spain, November 12-14, 2003. Revised
               Selected Papers},
  publisher = Springer,
  series    = LNCS,
  volume    = {3040},
  year      = {2004},
}

@article {ArnborgEtal93,
    author = {Arnborg, Stefan and Courcelle, Bruno and Proskurowski, Andrzej
              and Seese, Detlef},
     title = {An algebraic theory of graph reduction},
   journal = JACM,
    volume = {40},
      year = {1993},
    number = {5},
     pages = {1134--1164},
}
	

@article {BodlaenderKoster06,
    author = {Bodlaender, Hans L. and Koster, Arie M. C. A.},
     title = {Safe separators for treewidth},
   journal = DM,
    volume = {306},
      year = {2006},
    number = {3},
     pages = {337--350},
}




@article {NesetrilOssonademendez08c,
    author = {Ne{\v{s}}et{\v{r}}il, Jaroslav and Ossona de Mendez, Patrice},
     title = {Grad and classes with bounded expansion. {III}. {R}estricted
              graph homomorphism dualities},
   journal = {European J. Combin.},
    volume = EJC,
      year = {2008},
    number = {4},
     pages = {1012--1024},
}
		

@article {NesetrilOssonademendez08b,
    author = {Ne{\v{s}}et{\v{r}}il, Jaroslav and Ossona de Mendez, Patrice},
     title = {Grad and classes with bounded expansion. {II}. {A}lgorithmic
              aspects},
   journal = EJC,
    volume = {29},
      year = {2008},
    number = {3},
     pages = {777--791},
}
		

@article {NesetrilOssonademendez08a,
    author = {Ne{\v{s}}et{\v{r}}il, Jaroslav and Ossona de Mendez, Patrice},
     title = {Grad and classes with bounded expansion. {I}.
              {D}ecompositions},
   journal = EJC,
    volume = {29},
      year = {2008},
    number = {3},
     pages = {760--776},
}


		

@Misc{Suse08,
  title = 	 {Package Management/Sat Solver},
  howpublished = {\url{http://en.opensuse.org/Libzypp/Sat_Solver}},
  month = 	 {OpenSuSE Linux Distribution},
  year = 	 {2008},
  note = 	 {Retrieved 10 September 2008},
}


@InCollection{Smith06,
  author = 	 {Barbara M. Smith},
  title = 	 {Modelling},
  booktitle = 	 {Handbook of Constraint Programming},
  publisher =    {Elsevier},
  year = 	 {2006},
  editor = 	 {F. Rossi and P. van Beek and T. Walsh},
  chapter = 	 {11},
}


@Article{GomesSelman05,
  author = 	 {Carla P. Gomes and Bart Selman},
  title = 	 {Computational science:  Can get satisfaction},
  journal = 	 {Nature},
  year = 	 {2005},
  volume = 	 {435},
  pages = 	 {751--752},
  month = 	 JUN,
}


@article{SloperTelle08,
  author    = {Christian Sloper and
               Jan Arne Telle},
  title     = {An Overview of Techniques for Designing Parameterized Algorithms},
  journal   = TCJ,
  volume    = {51},
  number    = {1},
  year      = {2008},
  pages     = {122--136},
}



@article {EiterGottlob95a,
    author = {Eiter, Thomas and Gottlob, Georg},
     title = {The complexity of logic-based abduction},
   journal = JACM,
    volume = {42},
      year = {1995},
    number = {1},
     pages = {3--42},
}
@article {Gottlob92,
    author = {Gottlob, Georg},
     title = {Complexity results for nonmonotonic logics},
   journal = JLC,
    volume = {2},
      year = {1992},
    number = {3},
     pages = {397--425},
}
	

@book {Pearl88,
    author = {Pearl, Judea},
     title = {Probabilistic reasoning in intelligent systems: networks of
              plausible inference},
    series = {The Morgan Kaufmann Series in Representation and Reasoning},
 publisher = {Morgan Kaufmann},
   address = {San Mateo, CA},
      year = {1988},
}



@book {KorbNicholson04,
    author = {Korb, Kevin B. and Nicholson, Ann E.},
     title = {{B}ayesian artificial intelligence},
    series = {Computer Science and Data Analysis Series},
 publisher = {Chapman \& Hall/CRC, Boca Raton, FL},
      year = {2004},
}

@article{ChenMeng08,
  author    = {Jianer Chen and
               Jie Meng},
  title     = {On Parameterized Intractability: Hardness and Completeness},
  journal   = TCJ,
  volume    = {51},
  number    = {1},
  year      = {2008},
  pages     = {39--59},
}


@book {FreuderMackworth94,
     title = {Constraint-based reasoning},
    series = {Special Issues of Artificial Intelligence},
    editor = {Freuder, Eugene C. and Mackworth, Alan K.},
      note = {Reprinted from Artificial Intelligence {{\bf{5}}8} (1992), no.
              1-3,
              A Bradford Book},
 publisher = {MIT Press},
   address = {Cambridge, MA},
      year = {1994},
}


@Book{JosephsonJosephson94,
  editor = 	 {John R. Josephson and Susan G. Josephson},
  title = 	 {Abductive Inference:
                   Computation, Philosophy, Technology},
  publisher = 	 CamUP,
  year = 	 {1994},
  address = 	 {New York},
}

@book {Antoniou97,
    author = {Antoniou, Grigoris},
     title = {Nonmonotonic reasoning},
    series = {Artificial Intelligence},
      note = {With contributions by Mary-Anne Williams},
 publisher = {MIT Press},
   address = {Cambridge, MA},
      year = {1997},
}


@inproceedings{LeBerreSimon05,
  author    = {Daniel Le Berre and
               Laurent Simon},
  title     = {Fifty-Five Solvers in Vancouver: The SAT 2004 Competition},
  pages     = {321--344},
  booktitle     = {Theory and Applications of Satisfiability Testing, 7th International
               Conference, SAT 2004, Vancouver, BC, Canada, May 10-13,
               2004, Revised Selected Papers},
  publisher = Springer,
  series    = LNCS,
  volume    = {3542},
  year      = {2005},
}


@Book{HoosStuetzle04,
    author = {Hoos, Holger H. and St{\"u}tzle, Thomas},
  title = 	 {Stochastic Local Search: Foundations and Applications},
  publisher = 	 {Elsevier/Morgan Kaufmann},
  year = 	 {2004},
}

@article {EiterGottlob93,
    author = {Eiter, Thomas and Gottlob, Georg},
     title = {Propositional circumscription and extended closed-world
              reasoning are {$\Pi\sp {\rm P}\sb 2$}-complete},
   journal = TCS,
    volume = {114},
      year = {1993},
    number = {2},
     pages = {231--245},
}
	

@incollection {Minker82,
    author = {Minker, Jack},
     title = {On indefinite databases and the closed world assumption},
 booktitle = {6th conference on automated deduction ({N}ew {Y}ork, 1982)},
    series = LNCS,
    volume = {138},
     pages = {292--308},
 publisher = Springer,
      year = {1982},
}

@article {YahyaHenschen85,
    author = {Yahya, Adnan and Henschen, Lawrence J.},
     title = {Deduction in non-{H}orn databases},
   journal = JAR,
    volume = {1},
      year = {1985},
    number = {2},
     pages = {141--160},
}

@article {GelfondPrzymusinska85,
    author = {Gelfond, Michael and Przymusi{\'n}ska, Halina},
     title = {Negation as failure: careful closure procedure},
   journal = AI,
    volume = {30},
      year = {1986},
    number = {3},
     pages = {273--287},
}

@article {McCarthy80,
    author = {McCarthy, John},
     title = {Circumscription---a form of nonmonotonic reasoning},
      note = {Special issue on nonmonotonic logic},
   journal = AI,
    volume = {13},
      year = {1980},
    number = {1-2},
     pages = {27--39},
}
@article {ReiterReiter96,
    author = {Reiter, Harold and Reiter, Ashley},
     title = {The space of closed subsets of a convergent sequence},
   journal = {Math. Mag.},
    volume = {69},
      year = {1996},
    number = {3},
     pages = {217--221},
}



@incollection {KirousisKolaitis01,
    author = {Kirousis, Lefteris M. and Kolaitis, Phokion G.},
     title = {On the complexity of model checking and inference in minimal
              models (extended abstract)},
 booktitle = {Logic programming and nonmonotonic reasoning ({V}ienna, 2001)},
    series = LNCS,
    volume = {2173},
     pages = {42--53},
    publisher=Springer,
      year = {2001},
}
	

@article {NordhZanuttini09,
    author = {Nordh, Gustav and Zanuttini, Bruno},
     title = {What makes propositional abduction tractable},
   journal = AI,
    volume = {172},
      year = {2008},
    number = {10},
     pages = {1245--1284},
}


@article {Darwiche01,
    author = {Darwiche, Adnan},
     title = {Recursive conditioning},
   journal = AI,
    volume = {126},
      year = {2001},
    number = {1-2},
     pages = {5--41},
}		


@inproceedings{ZabiyakaDarwiche06,
  author    = {Yuliya Zabiyaka and
               Adnan Darwiche},
  title     = {Functional Treewidth: Bounding Complexity in the Presence
               of Functional Dependencies},
  booktitle     = {Theory and Applications of Satisfiability Testing - SAT
               2006, 9th International Conference, Seattle, WA, USA, August
               12-15, 2006, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4121},
  year      = {2006},
}

@inproceedings {CadoliDoniniSchaerf94,
    author = {Cadoli, Marco and Donini, Francesco M. and Schaerf, Marco},
     title = {Is intractability of non-monotonic reasoning a real drawback?},
 booktitle = {Proceedings of the {T}welfth {N}ational {C}onference on
              {A}rtificial {I}ntelligence, {V}ol.\ 1, 2 ({S}eattle, {WA},
              1994)},
     pages = {946--951},
 publisher = {AAAI Press},
      year = {1994},
}
	

@InProceedings{BoltGaag06,
  author = 	 {J.H. Bolt and L.C van der Gaag},
  title = 	 {Preprocessing the {MAP} Problem},
  booktitle = {Proceedings of the Third European Workshop on
    Probabilistic Graphical Models, Prague},
  pages = 	 {51--58},
  year = 	 {2006},
  editor = 	 {M. Studen\'{y} and J. Vomlel},
}


@article {BodlaenderKosterEijkhof05,
    author = {Bodlaender, Hans L. and Koster, Arie M. C. A. and van den
              Eijkhof, Frank},
     title = {Preprocessing rules for triangulation of probabilistic
              networks},
   journal = ComInt,
    volume = {21},
      year = {2005},
    number = {3},
     pages = {286--305},
}


@inproceedings{MazureSaisGregoire97,
  author    = {Bertrand Mazure and
               Lakhdar Sais and
               {\'E}ric Gr{\'e}goire},
  title     = {Local Search for Computing Normal Circumstances Models},
  year      = {1997},
  pages     = {565--566},
  booktitle = {Fuzzy Days: Computational Intelligence, 
               Theory and Applications, International
               Conference, 5th Fuzzy Days, Dortmund, Germany, April 28-30,
               1997, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {1226},
}


@InProceedings{KaskDechter99,
  author = 	 {K. Kask and R. Dechter},
  title = 	 {Stochastic Local Search For {B}ayesian Networks},
  booktitle = {Workshop on AI and Statistics 99},
  pages = 	 {113-­122},
  year = 	 {1999},
  editor = 	 {D. Heckerman and J. Whittaker},
  publisher = {Morgan Kaufmann Publishers},
}


@article {StearnsHunt96,
    author = {Stearns, Richard E. and Hunt, III, Harry B.},
     title = {An algebraic model for combinatorial problems},
   journal = SiamJC,
    volume = {25},
      year = {1996},
    number = {2},
     pages = {448--476},
}

@article {KoivistoSood03,
    author = {Koivisto, Mikko and Sood, Kismat},
     title = {Exact {B}ayesian structure discovery in {B}ayesian networks},
   journal = JMLR,
    volume = {5},
      year = {2003/04},
     pages = {549--573},
}



@Article{Husmmeier03,
  author = 	 {Dirk Husmeier},
  title = 	 {Sensitivity and specificity of inferring genetic regulatory
interactions from microarray experiments with dynamic {B}ayesian
networks},
  journal = 	 {Bioinformatics},
  year = 	 {2003},
  volume = 	 {19},
  number = 	 {17},
  pages = 	 {2271­-2282},
}

@article{HlinenyOumSeeseGottlob08,
  author    = {Petr Hlinen{\'y} and
               {Sang-il} Oum and
               Detlef Seese and
               Georg Gottlob},
  title     = {Width Parameters Beyond Tree-width and their Applications},
  journal   = TCJ,
  volume    = {51},
  number    = {3},
  year      = {2008},
  pages     = {326--362},
}


@inproceedings{GottlobPichlerWei08,
  author    = {Georg Gottlob and
               Reinhard Pichler and
               Fang Wei},
  title     = {Abduction with Bounded Treewidth: From Theoretical Tractability
               to Practically Efficient Computation},
  year      = {2008},
  pages     = {1541--1546},
  booktitle   = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,
               2008},
  publisher = {AAAI Press},
}

@article{DowneyFellowsLangston08,
  author    = {Rodney G. Downey and
               Michael R. Fellows and
               Michael A. Langston},
  title     = {The Computer Journal Special Issue on Parameterized Complexity:
               Foreword by the Guest Editors},
  journal   = TCJ,
  volume    = {51},
  number    = {1},
  year      = {2008},
  pages     = {1-6},
}
@article {Dechter99,
    author = {Dechter, Rina},
     title = {Bucket elimination: a unifying framework for reasoning},
   journal = AI,
    volume = {113},
      year = {1999},
    number = {1-2},
     pages = {41--85},
}
	


@article {HunterKreutzer08,
    author = {Hunter, Paul and Kreutzer, Stephan},
     title = {Digraph measures: {K}elly decompositions, games, and
              orderings},
   journal = TCS,
    volume = {399},
      year = {2008},
    number = {3},
     pages = {206--219},
}


@inproceedings{ChaviraDarwiche07,
  author    = {Mark Chavira and
               Adnan Darwiche},
  title     = {Compiling {B}ayesian Networks Using Variable Elimination},
  year      = {2007},
  pages     = {2443--2449},
  booktitle     = {IJCAI 2007, Proceedings of the 20th International Joint
               Conference on Artificial Intelligence, Hyderabad, India,
               January 6-12, 2007},
}

@article{GrammNickelsenTantau08,
  author    = {Jens Gramm and
               Arfst Nickelsen and
               Till Tantau},
  title     = {Fixed-Parameter Algorithms in Phylogenetics},
  journal   = TCJ,
  volume    = {51},
  number    = {1},
  year      = {2008},
  pages     = {79--101},
}



@InCollection{Bessiere06,
  author = 	 {Christian Bessi{\`e}re},
  title = 	 {Constraint Propagation},
  booktitle = 	 {Handbook of Constraint Programming},
  publisher =    {Elsevier},
  year = 	 {2006},
  editor = 	 {F. Rossi and P. van Beek and T. Walsh},
  chapter = 	 {3},
}

@article{BessiereHebrardHnichWalsh06,
  author    = {Christian Bessi{\`e}re and
               Emmanuel Hebrard and
               Brahim Hnich and
               Toby Walsh},
  title     = {The Complexity of Reasoning with Global Constraints},
  journal   = {Constraints},
  volume    = {12},
  number    = {2},
  year      = {2007},
  pages     = {239--259},
}



@article{DagumLuby93,
  author    = {Paul Dagum and
               Michael Luby},
  title     = {Approximating Probabilistic Inference in {B}ayesian Belief
               Networks is NP-Hard},
  journal   = AI,
  volume    = {60},
  number    = {1},
  year      = {1993},
  pages     = {141--153},
}



@article{GiannopoulosKnauerWhitesides08,
  author    = {Panos Giannopoulos and
               Christian Knauer and
               Sue Whitesides},
  title     = {Parameterized Complexity of Geometric Problems},
  journal   = TCJ,
  volume    = {51},
  number    = {3},
  year      = {2008},
  pages     = {372--384},
}

@article {MakowskyRotics99,
    author = {Makowsky, J. A. and Rotics, U.},
     title = {On the clique-width of graphs with few {$P\sb 4$}'s},
   journal = IJFCS,
    volume = {10},
      year = {1999},
    number = {3},
     pages = {329--348},
}
	
@article{Oum08,
  author    = {{Sang-il} Oum},
  title     = {Approximating rank-width and clique-width quickly},
  journal   = TALG,
  volume    = {5},
  number    = {1},
  year      = {2008},
}


@article {YagiuraIbaraki99,
    author = {Yagiura, M. and Ibaraki, T.},
     title = {Analyses on the {$2$} and {$3$}-flip neighborhoods for the
              {MAX} {SAT}},
   journal = JCO,
    volume = {3},
      year = {1999},
    number = {1},
     pages = {95--114},

}

@article{DantsinEtal02,
  author    = {Evgeny Dantsin and
               Andreas Goerdt and
               Edward A. Hirsch and
               Ravi Kannan and
               Jon M. Kleinberg and
               Christos H. Papadimitriou and
               Prabhakar Raghavan and
               Uwe Sch{\"o}ning},
  title     = {A deterministic $(2-2/(k+1))^n$ algorithm for k-{SAT}
               based on local search},
  journal   = TCS,
  volume    = {289},
  number    = {1},
  year      = {2002},
  pages     = {69--83},
}


@inproceedings{RazgonOSullivan08,
  author    = {Igor Razgon and
               Barry O'Sullivan},
  title     = {Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)},
  booktitle = {Automata, Languages and Programming, 35th International
               Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008,
               Proceedings, Part I: Tack A: Algorithms, Automata, Complexity,
               and Games},
  year      = {2008},
  pages     = {551--562},
  publisher = {Springer},
  series    = LNCS,
  volume    = {5125},
}

@article {Tutte52,
    author = {Tutte, W. T.},
     title = {The factors of graphs},
   journal = CanJM,
    volume = {4},
      year = {1952},
     pages = {314--328},
}
@article {Tutte54,
    AUTHOR = {Tutte, W. T.},
     title = {A short proof of the factor theorem for finite graphs},
   journal = CanJM,
    volume = {6},
      year = {1954},
     pages = {347--352},
}

@article {JohnsonPapadimitriouYannakakis88,
    author = {Johnson, David S. and Papadimitriou, Christos H. and
              Yannakakis, Mihalis},
     title = {How easy is local search?},
   journal = JCSS,
    volume = {37},
      year = {1988},
    number = {1},
     pages = {79--100},
}

% Probabilistic Paper


@article {AlonGutinKrivelevich04,
    author = {Alon, Noga and Gutin, Gregory and Krivelevich, Michael},
     title = {Algorithms with large domination ratio},
   journal = JAlg,
    volume = {50},
      year = {2004},
    number = {1},
     pages = {118--131},
}

@book {BangjensenGutin09,
    author = {Bang-Jensen, J{\o}rgen and Gutin, Gregory},
     title = {Digraphs},
    series = {Springer Monographs in Mathematics},
   edition = {Second},
 publisher = {Springer-Verlag London Ltd.},
   address = {London},
      year = {2009},
}


@incollection {Bourgain80,
    author = {Bourgain, J.},
     title = {Walsh subspaces of {$L\sp{p}$}-product spaces},
 booktitle = {Seminar on {F}unctional {A}nalysis, 1979--1980 ({F}rench)},
     note  = {Exp. No. 4A, 9},
 publisher = {\'Ecole Polytech.},
   address = {Palaiseau},
      year = {1980},
}



@Unpublished{GutinKimSzeiderYeo09,
  author = 	 {G.  Gutin and E. J. Kim and S. Szeider and A. Yeo},
  title = 	 {Fixed-parameter tractability of {Max 2-SAT}
                  parameteried above tight lower bound},
  note = 	 {In preparation},
  year = 	 {2009},
}



@inproceedings {HastadVenkatesh02,
    author = {H{\aa}stad, Johan and Venkatesh, S.},
     title = {On the advantage over a random assignment},
 booktitle = {Proceedings of the {T}hirty-{F}ourth {A}nnual {ACM}
              {S}ymposium on {T}heory of {C}omputing},
     pages = {43--52},
 publisher = {ACM},
   address = {New York},
      year = {2002},
   note = {Full version appeared in {\em Random Structures Algorithms}  
     25(2)  (2004), pp.~117--149},
}


@article {VillangerHeggernesPaulTelle08,
    author = {Villanger, Yngve and Heggernes, Pinar and Paul, Christophe and
              Telle, Jan Arne},
     title = {Interval completion is fixed parameter tractable},
   journal = SiamJC,
    volume = {38},
      year = {2008/09},
    number = {5},
     pages = {2007--2020},

}

@incollection {HeggernesPaulTelleVillanger07,
    author = {Heggernes, Pinar and Paul, Christophe and Telle, Jan Arne and
              Villanger, Yngve},
     title = {Interval completion with few edges},
 booktitle = {S{TOC}'07---{P}roceedings of the 39th {A}nnual {ACM}
              {S}ymposium on {T}heory of {C}omputing},
     pages = {374--381},
 publisher = {ACM},
      YEAR = {2007},
     note={Full version appeared in {\em SIAM J. Comput.} 38(5), 2008/09}, 
}



@article {MahajanRamanSikdar09,
    author = {Mahajan, Meena and Raman, Venkatesh and Sikdar, Somnath},
     title = {Parameterizing above or below guaranteed values},
   journal = JCSS,
    volume = {75},
      year = {2009},
    number = {2},
     pages = {137--153},
}




@inproceedings{SchederZumstein07,
  author    = {Dominik Scheder and
               Philipp Zumstein},
  title     = {Satisfiability with Exponential Families},
  booktitle     = {Theory and Applications of Satisfiability Testing - SAT
               2007, 10th International Conference, Lisbon, Portugal, May
               28-31, 2007, Proceedings},
  year      = {2007},
  pages     = {148--158},
  publisher = Springer,
  series    = LNCS,
  volume    = {4501},
}

@inproceedings{SchederZumstein08,
  author    = {Dominik Scheder and
               Philipp Zumstein},
  title     = {How Many Conflicts Does It Need to Be Unsatisfiable?},
  year      = {2008},
  pages     = {246--256},
  booktitle     = {Theory and Applications of Satisfiability Testing - SAT
               2008, 11th International Conference, SAT 2008, Guangzhou,
               China, May 12-15, 2008. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4996},
}


@incollection{KleinebuningKullmann09,
   author = {Kleine B{\"u}ning, Hans and Kullmann, Oliver},
   title = {Minimal Unsatisfiability and Autarkies},
   chapter = {11},
   pages = {339--401},
Editor = {Biere, A. and Heule, M. J. H. and van Maaren, H. and Walsh, T.},
    booktitle = {Handbook of Satisfiability},
    Publisher = {IOS Press},
    Year = {2009},
    Volume = {185},
    Series = {Frontiers in Artificial Intelligence and Applications},
}

@article{GottlobPichlerWei08a,
  author    = {Georg Gottlob and
               Reinhard Pichler and
               Fang Wei},
  title     = {Monadic Datalog over Finite Structures with Bounded Treewidth},
  journal   = {CoRR},
  volume    = {abs/0809.3140},
  year      = {2008},
}


@inproceedings{MarekNiemelaTruszczynski04,
  author    = {V. Wiktor Marek and
               Ilkka Niemel{\"a} and
               Miroslaw Truszczynski},
  title     = {Logic Programs With Monotone Cardinality Atoms},
  year      = {2004},
  pages     = {154--166},
  booktitle     = {Logic Programming and Nonmonotonic Reasoning, 7th International
               Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January
               6-8, 2004, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {2923},
  year      = {2004},
}



@InCollection{NiemelaSimons00,
  author = 	 {Ilkka Niemel{\"a} and Patrick Simons},
  title = 	 {Extending the smodels system},
  booktitle = 	 {Logic-Based Artificial Intelligence},
  pages = 	 {491--521},
  publisher = Kluwer,
  year = 	 {2000},
}


@article{BinhminhTelleVatshelle09,
  author    = {Binh-Minh Bui-Xuan and
               Jan Arne Telle and
               Martin Vatshelle},
  title     = {Fast {FPT} algorithms for vertex subset and vertex partitioning
               problems using neighborhood unions},
  journal   = {CoRR},
  volume    = {abs/0903.4796},
  year      = {2009},
}


% MAX-2-SAT

@incollection {Williams04,
    author = {Williams, Ryan},
     title = {A new algorithm for optimal constraint satisfaction and its
              implications},
 booktitle = {Automata, languages and programming (ICALP'04)},
    series = LNCS,
    volume = {3142},
     pages = {1227--1237},
 publisher = Springer,
      year = {2004},
}

@inproceedings {KojevnikovKulikov09,
    author = {Kojevnikov, Arist and Kulikov, Alexander S.},
     title = {A new approach to proving upper bounds for {MAX}-2-{SAT}},
 booktitle = {Proceedings of the {S}eventeenth {A}nnual {ACM}-{SIAM}
              {S}ymposium on {D}iscrete {A}lgorithms},
     pages = {11--17},
 publisher = ACM,
      year = {2006},
}
	

@inproceedings{GrammNiedermeier00,
  author    = {Jens Gramm and
               Rolf Niedermeier},
  title     = {Faster Exact Solutions for {MAX2SAT}},
  pages     = {174--186},
  booktitle     = {Algorithms and Complexity (CIAC 2000)},
  publisher = Springer,
  series    = LNCS,
  volume    = {1767},
  year      = {2000},
}


@inproceedings{RaibleFernau08,
  author    = {Daniel Raible and
               Henning Fernau},
  title     = {A New Upper Bound for {Max-2-SAT}: A Graph-Theoretic Approach},
  pages     = {551--562},
  booktitle     = {Mathematical Foundations of Computer Science (MFCS 2008)},
  publisher = Springer,
  series    = LNCS,
  volume    = {5162},
  year      = {2008},
}

@article {GrammHirschNiedermeierRossmanith93,
    author = {Gramm, Jens and Hirsch, Edward A. and Niedermeier, Rolf and
              Rossmanith, Peter},
     title = {Worst-case upper bounds for {MAX}-2-{SAT} with an application
              to {MAX}-{CUT}},
   journal = DAM,
    volume = {130},
      year = {2003},
    number = {2},
     pages = {139--155},
}


@article {Hastad01,
    author = {H{\aa}stad, Johan},
     title = {Some optimal inapproximability results},
   journal = JACM,
    volume = {48},
      year = {2001},
    number = {4},
     pages = {798--859},
}
 
@incollection {Johnson73,
    author = {Johnson, David S.},
     title = {Approximation algorithms for combinatorial problems},
 booktitle = {Fifth {A}nnual {ACM} {S}ymposium on {T}heory of {C}omputing
              ({A}ustin, {T}ex., 1973)},
     pages = {38--49},
 publisher = ACM,
      YEAR = {1973},
}
	

@book {BondyMurty08,
    author = {Bondy, J. A. and Murty, U. S. R.},
     title = {Graph theory},
    series = {Graduate Texts in Mathematics},
    volume = {244},
 publisher = Springer,
   address = {New York},
      year = {2008},
}
@article {Berge58,
    author = {Berge, Claude},
     title = {Sur le couplage maximum d'un graphe},
   journal = {C. R. Acad. Sci. Paris},
    volume = {247},
      year = {1958},
     pages = {258--259},
}

@inproceedings{SamerVeith09,
  author    = {Marko Samer and
               Helmut Veith},
  title     = {Encoding Treewidth into {SAT}},
  pages     = {45--50},
  booktitle     = {Theory and Applications of Satisfiability Testing - SAT
               2009, 12th International Conference, SAT 2009, Swansea,
               UK, June 30 - July 3, 2009. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {5584},
  year      = {2009},
}

# Weighted Model Counting

@inproceedings{SangBeameKautz05,
  author    = {Tian Sang and
               Paul Beame and
               Henry A. Kautz},
  title     = {Performing {B}ayesian Inference by Weighted Model Counting},
  pages     = {475--482},
  booktitle     = {Proceedings, The Twentieth National Conference on Artificial
               Intelligence and the Seventeenth Innovative Applications
               of Artificial Intelligence Conference, July 9-13, 2005,
               Pittsburgh, Pennsylvania, USA},
  publisher = {AAAI Press / The MIT Press},
  year      = {2005},
}


@article{ChaviraDarwiche08,
  author    = {Mark Chavira and
               Adnan Darwiche},
  title     = {On probabilistic inference by weighted model counting},
  journal   = AI,
  volume    = {172},
  number    = {6-7},
  year      = {2008},
  pages     = {772--799},
}

@inproceedings{FominGolovachLokshtanovSaurabh09,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Daniel Lokshtanov and
               Saket Saurabh},
  title     = {Clique-width: on the price of generality},
  year      = {2009},
  pages     = {825--834},
  editor    = {Claire Mathieu},
  booktitle     = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on
               Discrete Algorithms, SODA 2009, New York, NY, USA, January
               4-6, 2009},
  publisher = {SIAM},
  year      = {2009},
}


@inproceedings{FellowsRosamondFominLokshtanovSaurabhVillanger09,
  author    = {Michael R. Fellows and
               Frances A. Rosamond and
               Fedor V. Fomin and
               Daniel Lokshtanov and
               Saket Saurabh and
               Yngve Villanger},
  title     = {Local Search: Is Brute-Force Avoidable?},
  editor    = {Craig Boutilier},
  booktitle     = {IJCAI 2009, Proceedings of the 21st International Joint
               Conference on Artificial Intelligence, Pasadena, California,
               USA, July 11-17, 2009},
  year      = {2009},
  pages     = {486--491},
}


@article{MarxSchlotter09,
    author = "D\'aniel Marx and Ildik\'o Schlotter",
    title   ="Parameterized complexity and local search approaches for the 
              stable marriage problem with ties",
    journal =  "Algorithmica",
    year=   "2009",
    note =  "To appear",
}


@article {MarxSchlotter10,
    author = {Marx, D{\'a}niel and Schlotter, Ildik{\'o}},
     title = {Parameterized complexity and local search approaches for the
              stable marriage problem with ties},
   journal = Alg,
    volume = {58},
      year = {2010},
    number = {1},
     pages = {170--187},
}


@inproceedings{MarxSchlotter09b,
    author="D\'aniel Marx and Ildik\'o Schlotter",
    title=  " Stable assignment with couples: parameterized complexity 
            and local search",

    booktitle="Proceedings of IWPEC 2009, 4th International Workshop on
  Parameterized and Exact Computation, 10-11 September 2009, IT
  University of Copenhagen, Denmark",
  series = LNCS,
  year= "2009",
  note =  "To appear",
}


@article {MarxSchlotter10b,
    author = {Marx, D{\'a}niel and Schlotter, Ildik{\'o}},
     title = {Stable assignment with couples: parameterized complexity and
              local search},
   journal = DO,
    volume = {8},
      year = {2011},
    number = {1},
     pages = {25--40},
}
	



@article {FrickGrohe04,
    author = {Frick, Markus and Grohe, Martin},
     title = {The complexity of first-order and monadic second-order logic
              revisited},
   JOURNAL = APAL,
    volume = {130},
      year = {2004},
    number = {1-3},
     pages = {3--31},
}

% WWTF proposal

 

@inproceedings{MarquessilvaSakallah96,
  author    = {Jo{\~a}o P. Marques Silva and
               Karem A. Sakallah},
  title     = {{GRASP} - a new search algorithm for satisfiability},
  booktitle = {International Conference on Computer-Aided Design (ICCAD '96),
November 10-14, 1996, San Jose, CA, USA},
  year      = {1996},
  publisher = {ACM and IEEE},
  pages     = {220--227},
}



@inproceedings{BayardoSchrag96,
    author = {Roberto J. Bayardo and Robert Schrag},
    title = {Using {CSP} Look-Back Techniques to Solve Exceptionally Hard {SAT} Instances},
    booktitle = {Principles and Practice of Constraint Programming},
    year = {1996},
    pages = {46--60},
    publisher = Springer,
}

@inproceedings{Zhang97,
  author    = {Hantao Zhang},
  title     = {{SATO:} An Efficient Propositional Prover},
  booktitle     = {Automated Deduction - CADE-14, 14th International Conference
               on Automated Deduction, Townsville, North Queensland, Australia,
               July 13-17, 1997, Proceedings},
  year      = {1997},
  pages     = {272--275},
  publisher = Springer,
}

@inproceedings{MoskewiczMadiganZhaoZhangMalik01,
  author    = {Matthew W. Moskewicz and
               Conor F. Madigan and
               Ying Zhao and
               Lintao Zhang and
               Sharad Malik},
  title     = {Chaff: Engineering an Efficient SAT Solver},
  booktitle     = {Proceedings of the 38th Design Automation Conference, DAC
               2001, Las Vegas, NV, USA, June 18-22, 2001},
  year      = {2001},
  pages     = {530--535},
  publisher = {ACM},
}

@incollection{Prestwich09,
  author    = {Steven David Prestwich},
  title     = {{CNF} Encodings},
  booktitle = {Handbook of Satisfiability},
  year      = {2009},
  pages     = {75--97},
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
  publisher = {IOS Press},
}


@inproceedings{Sinz05,
  author    = {Carsten Sinz},
  title     = {Towards an Optimal CNF Encoding of Boolean Cardinality Constraints},
  pages     = {827--831},
  editor    = {Peter van Beek},
  booktitle     = {Principles and Practice of Constraint Programming - CP 2005,
               11th International Conference, CP 2005, Sitges, Spain, October
               1-5, 2005, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {3709},
  year      = {2005},
}

@article{LiffitonEtAl09,
  author    = {Mark H. Liffiton and
               Maher N. Mneimneh and
               In{\^e}s Lynce and
               Zaher S. Andraus and
               Jo{\~a}o Marques-Silva and
               Karem A. Sakallah},
  title     = {A branch and bound algorithm for extracting smallest minimal
               unsatisfiable subformulas},
  journal   = Cons,
  volume    = {14},
  number    = {4},
  year      = {2009},
  pages     = {415--442},
}

@inproceedings{Huang05,
  author    = {Jinbo Huang}, 
 title     = {{MUP:} a minimal unsatisfiability prover},
  pages     = {432--437},
  editor    = {Tingao Tang},
  booktitle     = {Proceedings of the 2005 Conference on Asia South Pacific
               Design Automation, ASP-DAC 2005, Shanghai, China, January
               18-21, 2005},
  publisher = {ACM Press},
  year      = {2005},
}




@inproceedings{NieuwenhuisOliveras06,
  author    = {Robert Nieuwenhuis and
               Albert Oliveras},
  title     = {On {SAT} Modulo Theories and Optimization Problems},
  pages     = {156--169},
  editor    = {Armin Biere and
               Carla P. Gomes},
  booktitle     = {Theory and Applications of Satisfiability Testing - SAT
               2006, 9th International Conference, Seattle, WA, USA, August
               12-15, 2006, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4121},
  year      = {2006},
}


@incollection{BarrettSebastianiSeshiaTinelli09,
  author    = {Clark W. Barrett and
               Roberto Sebastiani and
               Sanjit A. Seshia and
               Cesare Tinelli},
  title     = {Satisfiability Modulo Theories},
  pages     = {825--885},
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
  booktitle = {Handbook of Satisfiability},
  publisher = {IOS Press},
  volume    = {185},
  year      = {2009},
}
@inproceedings{MarquessilvaPlanes08,
  author    = {Jo{\~a}o Marques-Silva and
               Jordi Planes},
  title     = {Algorithms for Maximum Satisfiability using Unsatisfiable
               Cores},
  year      = {2008},
  pages     = {408--413},
  booktitle     = {Design, Automation and Test in Europe, DATE 2008, Munich,
               Germany, March 10-14, 2008},
  publisher = {IEEE},
}

               
@inproceedings{DaviesBacchus07,
  author    = {Jessica Davies and
               Fahiem Bacchus},
  title     = {Using More Reasoning to Improve {\#SAT}
 Solving},
  year      = {2007},
  pages     = {185--190},
  booktitle     = {Proceedings of the Twenty-Second AAAI Conference on Artificial
               Intelligence, July 22-26, 2007, Vancouver, British Columbia,
               Canada},
  publisher = {AAAI Press},
}


@inproceedings{ChaviraDarwiche05,
  author    = {Mark Chavira and
               Adnan Darwiche},
  title     = {Compiling {B}ayesian Networks with Local Structure},
  year      = {2005},
  pages     = {1306--1312},
  editor    = {Leslie Pack Kaelbling and
               Alessandro Saffiotti},
  booktitle     = {IJCAI-05, Proceedings of the Nineteenth International Joint
               Conference on Artificial Intelligence, Edinburgh, Scotland,
               UK, July 30-August 5, 2005},
  isbn      = {0938075934},
}

@inproceedings{Hale80,
  author = {W. K. Hale},
  title = {Frequency assignment: theory and applications},
 booktitle = {Proc. IEEE},
 volume = {68},
 issue = {12},
  year = {1980},
 pages = {1497-–1514},
}

@techreport{BodlaenderWolle04,
  author = {Bodlaender, Hans~L. and Wolle, Thomas},
  year = {2004},
  title = {A Note on the Complexity of Network Reliability Problems},
  number = {UU-CS-2004-001},
  institution = {Department of Information and Computing Sciences, Utrecht University},
}

@incollection{Sakallah09,
  author    = {Karem A. Sakallah},
  title     = {Symmetry and Satisfiability},
  booktitle = {Handbook of Satisfiability},
  year      = {2009},
  pages     = {289--338},
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
  publisher = {IOS Press},
  volume    = {185},
}


@incollection{RousselManquinho09,
  author    = {Olivier Roussel and
               Vasco M. Manquinho},
  title     = {Pseudo-Boolean and Cardinality Constraints},
  booktitle = {Handbook of Satisfiability},
  year      = {2009},
  pages     = {695-733},
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
  publisher = {IOS Press},
}


@inproceedings{FederHellKleinMotwani99,
    author = {Feder, Tomas and Hell, Pavol and Klein, Sulamita and Motwani,
              Rajeev},
     title = {Complexity of graph partition problems},
 booktitle = {Annual {ACM} {S}ymposium on {T}heory of {C}omputing
              ({A}tlanta, {GA}, 1999)},
     pages = {464--472},
 publisher = {ACM},
   address = {New York},
      year = {1999},
}

@article {Telle94,
    author = {Telle, Jan Arne},
     title = {Complexity of domination-type problems in graphs},
   journal = NJC,
    volume = {1},
      year = {1994},
    number = {1},
     pages = {157--171},
}

@inproceedings{AlzoubiWanFriederF02,
  author    = {Khaled M. Alzoubi and
               Peng-Jun Wan and
               Ophir Frieder},
  title     = {Message-optimal connected dominating sets in mobile ad hoc
               networks},
  pages     = {157--164},
  booktitle     = {Proceedings of the 3rd ACM Interational Symposium on Mobile
               Ad Hoc Networking and Computing, MobiHoc 2002, June 9-11,
               2002, Lausanne, Switzerland},
  publisher = {ACM},
  year      = {2002},
}


@article{StojmenovicSeddighZunic02,
  author    = {Ivan Stojmenovic and
               Mahtab Seddigh and
               Jovisa D. Zunic},
  title     = {Dominating Sets and Neighbor Elimination-Based Broadcasting
               Algorithms in Wireless Networks},
  journal   = {IEEE Trans. Parallel Distrib. Syst.},
  volume    = {13},
  number    = {1},
  year      = {2002},
  pages     = {14--25},
}


@article {CooperKlasingZito05,
  author =	 {Cooper, Colin and Klasing, Ralf and Zito, Michele},
  title =	 {Lower bounds and algorithms for dominating sets in web
                  graphs},
  journal =	 {Internet Math.},
  volume =	 {2},
  year =	 {2005},
  number =	 {3},
  pages =	 {275--300},
}


@inproceedings{ShamsiKoushanfarPotkonjakP08,
  author =	 {Davood Shamsi and Farinaz Koushanfar and Miodrag Potkonjak},
  title =	 {Challenging benchmark for location discovery in ad hoc
                  networks: foundations and applications},
  pages =	 {361--370},
  editor =	 {Xiaohua Jia and Ness B. Shroff and Peng-Jun Wan},
  booktitle =	 {Proceedings of the 9th ACM Interational Symposium on Mobile
                  Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong,
                  China, May 26-30, 2008},
  publisher =	 {ACM},
  year =	 {2008},
}


@Misc{Dimacs92,
  author = {DIMACS},
  title =	 {The Second {DIMACS} Implementation Challenge:
                  1992-1993. {NP} Hard Problems: Maximum Clique, Graph
                  Coloring, and Satisfiability},
  note =	 {\url{http://dimacs.rutgers.edu/Challenges}},
}







@Article{ChaitinEtAl81,
  author =	 {Gregory J. Chaitin and Mark A. Auslander and Ashok
                  K. Chandra and John Cocke and Martin E. Hopkins and Peter
                  W. Markstein},
  title =	 {Register allocation via coloring},
  journal =	 {Computer Languages},
  year =	 {1981},
  volume =	 {6},
  pages =	 {47--57},
}



@article {NieuwenhuisOliverasTinelli06,
    author = {Nieuwenhuis, Robert and Oliveras, Albert and Tinelli, Cesare},
     title = {Solving {SAT} and {SAT} modulo theories: from an abstract
              {D}avis-{P}utnam-{L}ogemann-{L}oveland procedure to {${\rm
              DPLL}(T)$}},
   journal = JACM,
    volume = {53},
      year = {2006},
    number = {6},
     pages = {937--977},
}


@Misc{GOBLIN,
  author = 	 {Christian Fremuth-Paeger},
  title = 	 {{GOBLIN:} A Graph Object Library for Network Programming
                  Problems},
  note = 	 {\url{http://www.math.uni-augsburg.de/~fremuth/goblin.html}},
}

@inproceedings{YiDingOporowski07,
  author =	 {Tong Yi and Guoli Ding and Bogdan Oporowski},
  title =	 {A Low Bound for Broadcast in Optical Networks of Bounded
                  Treewidth Using Fewest Converters},
  pages =	 {142--149},
  booktitle =	 {Proceedings of the 26th IEEE International Performance
                  Computing and Communications Conference, IPCCC 2007, April
                  11-13, 2007, New Orleans, Louisiana, USA},
  publisher =	 {IEEE Computer Society},
  year =	 {2007},
}


@inproceedings{BodlaenderTanDijkLeeuwen08,
  author =	 {Hans L. Bodlaender and Richard B. Tan and Thomas C. van Dijk
                  and Jan van Leeuwen},
  title =	 {Integer Maximum Flow in Wireless Sensor Networks with Energy
                  Constraint},
  pages =	 {102--113},
  editor =	 {Joachim Gudmundsson},
  booktitle =	 {Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on
                  Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008,
                  Proceedings},
  publisher =	 Springer,
  series =	 LNCS,
  volume =	 5124,
  year =	 2008,
}




@book{Harms95,  
author =	 {Harms, Daryl D.},
   title =	 {Network Reliability: Experiments with a Symbolic Algebra
                  Environment},
  year =	 {1995},
  publisher =	 {CRC Press, Inc.},
  address =	 {Boca Raton, FL, USA},
}




@article {Nieminen74,
    author = {Nieminen, J.},
     title = {A linear pseudo-{B}oolean viewpoint on matching and other
              central concepts in graph theory},
   journal = {Zastos. Mat.},
    volume = {14},
      year = {1974},
     pages = {365--369},
}
		

@article {HammerSergiu69,
    author = {Hammer, Peter L. and Rudeanu, Sergiu},
     title = {Pseudo-{B}oolean programming},
   journal = {Operations Res.},
    volume = {17},
      year = {1969},
     pages = {233--261},
}
		

@book {GloverKochenberger03,
     title = {Handbook of metaheuristics},
    series = {International Series in Operations Research \& Management
              Science, 57},
    editor = {Glover, Fred and Kochenberger, Gary A.},
 publisher = Kluwer,
   address = {Boston, MA},
      year = {2003},
}

@incollection{GiunchigliaMarinNarizzano09,
  author    = {Enrico Giunchiglia and
               Paolo Marin and
               Massimo Narizzano},
  title     = {Reasoning with Quantified Boolean Formulas},
  pages     = {761--780},
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
  booktitle = {Handbook of Satisfiability},
  publisher = {IOS Press},
  volume    = {185},
  year      = {2009},
}

@incollection{GomesSabharwalSelman09,
  author    = {Carla P. Gomes and
               Ashish Sabharwal and
               Bart Selman},
  title     = {Model Counting},
  pages     = {633--654},
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
  booktitle = {Handbook of Satisfiability},
  publisher = {IOS Press},
  volume    = {185},
  year      = {2009},
}



@incollection{BalasundaramButenko06,
  author    = {Balabhaskar Balasundaram and Sergiy Butenko},
  title     = {Graph Domination, Coloring and Cliques in Telecommunications},
  pages     = {865--890},
  editor    = {M. G. C. Resede and P. M. Pardalos},
  booktitle = {Handbook of Optimization in Telecommunications},
  publisher = Springer,
  year      = {2006},
}




@incollection{KonakSmith06,
  author    = {Abdullah Konak and Alice E. Smith},
  title     = {Network Reliability Optimization},
  pages     = {735--760},
  editor    = {M. G. C. Resede and P. M. Pardalos},
  booktitle = {Handbook of Optimization in Telecommunications},
  publisher = Springer,
  year      = {2006},
}


@incollection{MinChinchuluun06,
  author    = {Manki Min and Altannar Chinchuluun},
  title     = {Optimization in Wireless Networks},
  pages     = {891--915},
  editor    = {M. G. C. Resede and P. M. Pardalos},
  booktitle = {Handbook of Optimization in Telecommunications},
  publisher = Springer,
  year      = {2006},
}






@incollection{JaumardMeyerThiongane06,
  author    = {Brigitte Jaumard and  Christophe Meyer and and Babacar Thiongane},
  title     = {{ILP} Formulations For The Routing And Wavelength Assignment
                  Problem: Symmetric Systems},
  pages     = {637--677},
  editor    = {M. G. C. Resede and P. M. Pardalos},
  booktitle = {Handbook of Optimization in Telecommunications},
  publisher = Springer,
  year      = {2006},
}


@incollection{DahlGouveiaRequejo06,
  author    = {Geir Dahl and Luis Gouveia and Cristina Requejo},
  title     = {On formulations and methods for the hop-constrained minimum
                  spanning tree problem},
  pages     = {493--515},
  editor    = {M. G. C. Resede and P. M. Pardalos},
  booktitle = {Handbook of Optimization in Telecommunications},
  publisher = Springer,
  year      = {2006},
}



@incollection{Voss06,
  author    = {Stefan Vo{\ss}},
  title     = {Steiner tree problems in telecommunications},
  pages     = {459--462},
  editor    = {M. G. C. Resede and P. M. Pardalos},
  booktitle = {Handbook of Optimization in Telecommunications},
  publisher = Springer,
  year      = {2006},
}

@inproceedings{Wenzel99,
  author    = {Markus Wenzel},
  title     = {Isar - A Generic Interpretative Approach to Readable Formal
               Proof Documents},
  year      = {1999},
  editor    = {Yves Bertot and
               Gilles Dowek and
               Andr{\'e} Hirschowitz and
               C. Paulin and
               Laurent Th{\'e}ry},
  booktitle     = {Theorem Proving in Higher Order Logics, 12th International
                  Conference, TPHOLs'99, Nice, France, September, 1999,
                  Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {1690},
}



@incollection{LiManya09,
  author    = {Chu Min Li and
               Felip Many{\`a}},
  title     = {MaxSAT, Hard and Soft Constraints},
  pages     = {613--631},
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
  booktitle = {Handbook of Satisfiability},
  publisher = {IOS Press},
  year      = {2009},
}
   w
@incollection{MarquessilvaLynceMalik09,
  author    = {Jo{\~a}o P. Marques Silva and
               In{\^e}s Lynce and
               Sharad Malik},
  title     = {Conflict-Driven Clause Learning SAT Solvers},
  booktitle = {Handbook of Satisfiability},
  year      = {2009},
  pages     = {131--153},
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
  publisher = {IOS Press},
}

@inproceedings{GolovachKratochvilSuchy09,
  author    = {Petr A. Golovach and
               Jan Kratochv\'{\i}l and
               Ondrej Such{\'y}},
  title     = {Parameterized Complexity of Generalized Domination Problems},
  pages     = {133--142},
  editor    = {Christophe Paul and
               Michel Habib},
  booktitle     = {Graph-Theoretic Concepts in Computer Science, 35th
                  International Workshop, WG 2009, Montpellier, France, June
                  24-26, 2009.  Revised Papers},
  series    = LNCS,
  publisher = Springer,
  volume    = {5911},
  year      = {2010},
}



@Book{KosterMunioz09,
  editor = 	 {A. M. C. Koster and Z. Munioz },
  title = 	 {Graphs and Algorithms
                     in Communication Networks: Studies in Broadband, 
                  Optical, Wireless and Ad
                  Hoc Networks},
  publisher = 	 Springer,
  year = 	 {2009},
}


@Book{ResendePardalos09,
  editor = 	 {M. G. C. Resende and P. M. Pardalos },
  title = 	 {Handbook of
    Optimization in Telecommunications},
  publisher = 	 Springer,
  year = 	 {2006},
}



 @Book{EasleyKleinberg10,
  author = 	 {D. Easley and J. Kleinberg},
  title = 	 {Networks, Crowds, and Markets:
    Reasoning About a Highly Connected World},
  publisher = 	 {Cambridge University
  Press},
  year = 	 {2010},
  note = 	 {In
  press. Manuscript available from Prof.~Kleinberg's homepage.},
}

@Book{BiereHeuleMaarenWalsh09,
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
  title     = {Handbook of Satisfiability},
  publisher = {IOS Press},
  series    = {Frontiers in Artificial Intelligence and Applications},
  volume    = {185},
  year      = {2009},
}



  	
@InProceedings{Lloyd94,
  author = 	 {J. W. Lloyd},
  title = 	 {Practical Advantages of Declarative Programming},
  booktitle = {Joint Conference on Declarative Programming, GULP-PRODE 1994},
  pages = 	 {18--30},
  year = 	 {1994},
}




@article {LundYannakakis94,
    author = {Lund, Carsten and Yannakakis, Mihalis},
     title = {On the hardness of approximating minimization problems},
   journal = JACM,
    volume = {41},
      year = {1994},
    number = {5},
     pages = {960--981},
}


@article {GuhaKhuller98,
   author = {Guha, S. and Khuller, S.},
     title = {Approximation algorithms for connected dominating sets},
   journal = Alg,
    volume = {20},
      year = {1998},
    number = {4},
     pages = {374--387},
}

@article{EglySeidlWoltran09,
  author    = {Uwe Egly and
               Martina Seidl and
               Stefan Woltran},
  title     = {A solver for {QBFs} in negation normal form},
  journal   = Cons,
  volume    = {14},
  number    = {1},
  year      = {2009},
  pages     = {38--79},
}

@book {Schrijver86,
    author = {Schrijver, Alexander},
     title = {Theory of linear and integer programming},
    series = {Wiley-Interscience Series in Discrete Mathematics},
 publisher = {John Wiley \& Sons Ltd.},
   address = {Chichester},
      year = {1986},
}

@article{Kante07,
  author    = {Mamadou Moustapha Kant{\'e}},
  title     = {The rank-width of Directed Graphs},
  journal   = {CoRR},
  volume    = {abs/0709.1433},
  year      = {2007},
}



@inproceedings{FriedmanKoller00,
    author = {Friedman, Nir and Koller, Daphne},
    title = {Being {B}ayesian about Network Structure},
    booktitle = {Machine Learning},
    year = {2000},
    pages = {201--210}
}

@article{KoivistoSoodMaxwell04,
    author = {Koivisto, Mikko and Sood, Kismat and Chickering, Maxwell},
    title = {Exact {B}ayesian Structure Discovery in {B}ayesian Networks},
    journal = {J. of Machine Learning Research},
    year = {2004},
    volume = {5},
    pages = {2004}
}





@InProceedings{ParviainenKoivisto09,
  author = 	 {Pekka Parviainen and Mikko Koivisto},
  title = 	 {Exact Structure Discovery in {B}ayesian Networks with Less
                  Space},
  booktitle = {25th Conference on Uncertainty in Artificial Intelligence (UAI
                  2009)},
  year = 	 {2009},
}


@article{HeckermanGeigerChickering95,
  author    = {David Heckerman and
               Dan Geiger and
               David Maxwell Chickering},
  title     = {Learning {B}ayesian Networks: The Combination of Knowledge
               and Statistical Data},
  journal   = ML,
  volume    = {20},
  number    = {3},
  year      = {1995},
  pages     = {197--243},
}

@article{Schwarz78,
  title={Estimating the dimension of a model},
  author={Schwarz, Gideon},
  journal={The Annals of Statistics},
  volume={6},
  number={2},
  pages={461--464},
  year={1978},
  publisher={Institute of Mathematical Statistics}
}

@article{Akaike74,
  title={A new look at the statistical model identification},
  author={Akaike, Hirotugu},
  journal={IEEE transactions on automatic control},
  volume={19},
  number={6},
  pages={716--723},
  year={1974},
  publisher={Ieee}
}

@article{Raftery95,
 ISSN = {00811750, 14679531},
 author = {Adrian E. Raftery},
 journal = {Sociological Methodology},
 pages = {111--163},
 publisher = {[American Sociological Association, Wiley, Sage Publications, Inc.]},
 title = {{B}ayesian Model Selection in Social Research},
 volume = {25},
 doi = {10.2307/271063},
 year = {1995}
}


@article {PerrierImotoMiyano08,
    author = {Perrier, Eric and Imoto, Seiya and Miyano, Satoru},
     title = {Finding optimal {B}ayesian network given a super-structure},
   journal = JMLR,
    volume = {9},
      year = {2008},
     pages = {2251--2286},
}


@InProceedings{SilanderMyllymaki06,
  author = 	 {Tomi Silander and Petri Myllym\"{a}ki},
  title = 	 {A simple approach for finding the globally optimal {B}ayesian
                  network structure},
  booktitle = {22nd Conference on Uncertainty in Artificial Intelligence, 13 -
                  16 July 2006, Cambridge, Massachusets, USA.},
  year = 	 {2006},
}


@incollection {Chickering95,
    author = {Chickering, David Maxwell},
     title = {Learning {B}ayesian networks is {NP}-complete},
 booktitle = {Learning from data ({F}ort {L}auderdale, {FL}, 1995)},
    series = {Lecture Notes in Statist.},
    volume = {112},
     pages = {121--130},
 publisher = Springer,
      year = {1996},
}


@article {Chickering03,
    author = {Chickering, David Maxwell},
     title = {Optimal structure identification with greedy search},
   journal = JMLR,
    volume = {3},
      year = {2003},
    number = {3},
     pages = {507--554},
}


@incollection {Chickering95b,
  author =	 {Chickering, David Maxwell},
  title =	 {A transformational characterization of equivalent {B}ayesian
                  network structures},
  booktitle =	 {Uncertainty in artificial intelligence ({M}ontreal, {PQ},
                  1995)},
  pages =	 {87--98},
  publisher =	 {Morgan Kaufmann},
  address =	 {San Francisco, CA},
  year =	 {1995},
}

@inproceedings{GogateDechter04,
  author =	 {Vibhav Gogate and Rina Dechter},
  title =	 {A Complete Anytime Algorithm for Treewidth},
  booktitle =	 {Proceedings of the Twentieth Conference
                  Annual Conference on Uncertainty in Artificial Intelligence
                  (UAI-04)},
  publisher =	 {AUAI Press},
  address =	 {Arlington, Virginia},
  year =	 {2004},
  pages =	 {201--208},
} 

@article {Dunne07,
    author = {Dunne, Paul E.},
     title = {Computational properties of argument systems satisfying
              graph-theoretic constraints},
   journal = AI,
    volume = {171},
      year = {2007},
    number = {10-15},
     pages = {701--729},
}

@article {BenchcaponDunne07,
    author = {Bench-Capon, T. J. M. and Dunne, Paul E.},
     title = {Argumentation in artificial intelligence},
   journal = AI,
    volume = {171},
      year = {2007},
    number = {10-15},
     pages = {619--641},
}
	

@article {Dung95,
    author = {Dung, Phan Minh},
     title = {On the acceptability of arguments and its fundamental role in
              nonmonotonic reasoning, logic programming and {$n$}-person
              games},
   journal = AI,
    volume = {77},
      year = {1995},
    number = {2},
     pages = {321--357},
}
	
@article {BenchCapon03,
    author = {Bench-Capon, Trevor J. M.},
     title = {Persuasion in practical argument using value-based
              argumentation frameworks},
   journal = JLC,
    volume = {13},
      year = {2003},
    number = {3},
     pages = {429--448},

}

@article {ChenLiuLuOsullivanRazgon08,
    author = {Chen, Jianer and Liu, Yang and Lu, Songjian and O'Sullivan,
              Barry and Razgon, Igor},
     title = {A fixed-parameter algorithm for the directed feedback vertex
              set problem},
   journal = JACM,
    volume = {55},
      year = {2008},
    number = {5},
     pages = {Art. 21, 19},
}




@InCollection{BaroniGiacomin09,
  author = 	 {Pietro Baroni and  Massimiliano Giacomin},
  title = 	 {Semantics of Abstract Argument Systems},
  booktitle = 	 {Argumentation in Artificial Intelligence},
  pages = 	 {25--44},
  publisher = Springer,
  year = 	 {2009},
  editor = 	 {Rahwan, Iyad and Simari, Guillermo},
}


@article {BenchcaponDoutreDunne07,
    author = {Bench-Capon, Trevor J. M. and Doutre, Sylvie and Dunne, Paul
              E.},
     title = {Audiences in argumentation frameworks},
   journal = AI,
    volume = {171},
      year = {2007},
    number = {1},
     pages = {42--71},
}

@inproceedings{DunneBenchcapon04,
  author    = {Paul E. Dunne and
               Trevor J. M. Bench-Capon},
  title     = {Complexity in Value-Based Argument Systems},
  pages     = {360--371},
  editor    = {Jos{\'e} J{\'u}lio Alferes and
               Jo{\~a}o Alexandre Leite},
  booktitle     = {Logics in Artificial Intelligence, 9th European Conference,
               JELIA 2004, Lisbon, Portugal, September 27-30, 2004, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {3229},
  year      = {2004},
}



@InCollection{DunneWooldridge09,
  author = 	 {Paul E. Dunne and Michael Wooldridge},
  title = 	 {Complexity of Abstract Argumentation},
  booktitle = 	 {Argumentation in Artificial Intelligence},
  pages = 	 {85--104},
  publisher =    Springer,
  year = 	 {2009},
  editor = 	 {L. Rahwan and G. R. Simari},
}



@TechReport{DvorakWoltran09,
  author =	 {Wolfgang Dvo\v{r}\'{a}k and Stefan Woltran},
  title =	 {Technical Note: Complexity of Stage Semantics in
                  Argumentation Frameworks},
  institution =	 {Technische Universit\"{a}t Wien},
  year =	 {2009},
  number =	 {DBAI-TR-2009-66},
}


@inproceedings{Gebauer09,
  author    = {Heidi Gebauer},
  title     = {Disproof of the Neighborhood Conjecture with Implications
               to SAT},
  pages     = {764--775},
  editor    = {Amos Fiat and
               Peter Sanders},
  booktitle    = {ESA 2009, 17th Annual European Symposium, Copenhagen,
               Denmark, September 7-9, 2009. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {5757},
  year      = {2009},
}


@inproceedings{GelfondLifschitz88,
  author    = {Michael Gelfond and
               Vladimir Lifschitz},
  title     = {The Stable Model Semantics for Logic Programming},
  editor    = {Robert A. Kowalski and Kenneth A. Bowen}, 
booktitle = {Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988},
publisher = {MIT Press},
  year      = {1988},
  pages     = {1070-1080},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}



@article {ErdosRado60,
    author = {Erd{\H{o}}s, P. and Rado, R.},
     title = {Intersection theorems for systems of sets},
   journal = {J. London Math. Soc.},
    volume = {35},
      year = {1960},
     pages = {85--90},
}


@article {BodlaenderDowneyFellowsHermelin09,
    author = {Bodlaender, Hans L. and Downey, Rodney G. and Fellows, Michael
              R. and Hermelin, Danny},
     title = {On problems without polynomial kernels},
   journal = JCSS,
    volume = {75},
      year = {2009},
    number = {8},
     pages = {423--434},
}


@inproceedings{FriedmanKoller00,
    author = {Friedman, Nir and Koller, Daphne},
    title = {Being {B}ayesian about Network Structure},
    booktitle = {Machine Learning},
    year = {2000},
    pages = {201--210}
}

@article{KoivistoSoodMaxwell04,
    author = {Koivisto, Mikko and Sood, Kismat and Chickering, Maxwell},
    title = {Exact {B}ayesian Structure Discovery in {B}ayesian Networks},
    journal = {J. of Machine Learning Research},
    year = {2004},
    volume = {5},
    pages = {2004}
}





@inproceedings{ChechetkaG07,
  author    = {Anton, Chechetka and
               Carlos, Guestrin},
  title     = {Efficient Principled Learning of Thin Junction Trees},
  booktitle = {NIPS},
  year      = {2007},
}

@article{AbbeelKN06,
  author    = {Pieter, Abbeel and
               Daphne, Koller and
               Andrew, Y. Ng},
  title     = {Learning Factor Graphs in Polynomial Time and Sample Complexity},
  journal   = {Journal of Machine Learning Research},
  volume    = {7},
  year      = {2006},
  pages     = {1743--1788},
}




@inproceedings{Narasimhan04,
    author = {Mukund, Narasimhan and Jeff, Bilmes},
    title = {PAC-learning bounded tree-width graphical models},
    booktitle = {In UAI},
    year = {2004}
}

@article {RamanRavikumarRao98,
    author = {Raman, Venkatesh and Ravikumar, B. and S. Srinivasa Rao},
     title = {A simplified {NP}-complete {MAXSAT} problem},
   journal = IPL,
    volume = {65},
      year = {1998},
    number = {1},
     pages = {1--6},
}


 @inproceedings{CaoChenLiu10,
  author    = {Yixin Cao and
               Jianer Chen and
               Yang Liu},
  title     = {On Feedback Vertex Set New Measure and New Structures},
  year      = {2010},
  pages     = {93--104},
  editor    = {Haim Kaplan},
  booktitle     = {Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium
               and Workshops on Algorithm Theory, Bergen, Norway, June
               21-23, 2010. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {6139},
}



@incollection {Uehara02,
    author = {Uehara, Ryuhei},
     title = {Linear time algorithms on chordal bipartite and strongly
              chordal graphs},
 booktitle = {Automata, languages and programming},
    series = LNCS,
    volume = {2380},
     pages = {993--1004},
 publisher = {Springer},
      year = {2002},
}


@TechReport{HammerMaffrayPreismann89,
  author = 	 {P. L. Hammer and  F. Maffray and M. Preismann},
  title = 	 {A characterization of chordal bipartite graphs},
  institution =  {Rutgers University},
  year = 	 {1989},
  address = 	 {New Brunswick, NJ},
}


@Unpublished{PelsmajerTokazyWest04,
  author =	 {Michael J. Pelsmajer and Jacent Tokazy and Douglas
                  B. West},
  title =	 {New Proofs for Strongly Chordal Graphs and Chordal
                  Bipartite Graphs},
  note =          {Unpublished Manuscript},
  year =	 {2004}
}



@article {GolumbicGoss78,
    author = {Golumbic, Martin Charles and Goss, Clinton F.},
     title = {Perfect elimination and chordal bipartite graphs},
   journal = JGT,
    volume = {2},
      year = {1978},
    number = {2},
     pages = {155--163},
}




@article{Marx10,
  author =	 {D\'aniel Marx},
  title =	 {Chordal deletion is fixed-parameter tractable},
  journal =	 Alg,
  year =	 {2010},
  volume =	 {57},
  number =	 {4},
  pages =	 {747--768},
}

@article{GutinEtAl10,
  author    = {Gregory Gutin and
               Leo van Iersel and
               Matthias Mnich and
               Anders Yeo},
  title     = {All Ternary Permutation Constraint Satisfaction Problems
               Parameterized Above Average Have Polynomial Kernels},
  journal   = {CoRR},
  volume    = {abs/1004.1956},
  year      = {2010},
}





@misc{FellowsEtal10,
  author = 	 {Michael R. Fellows and Tobias Friedrich and Danny
                  Hermelin and Nina Narodytska and Frances A. Rosamond},
  title = 	 {Constraint Satisfaction Problems: Convexity Makes
                  AllDifferent Constraints Tractable},
  year = 	 {2010},
  note = 	 {Manuscript},
}



@inproceedings{HoeveEtAlS06,
  author    = {Willem Jan van Hoeve and
               Gilles Pesant and
               Louis-Martin Rousseau and
               Ashish Sabharwal},
  title     = {Revisiting the Sequence Constraint},
  year      = {2006},
  pages     = {620--634},
  editor    = {Fr{\'e}d{\'e}ric Benhamou},
  booktitle     = {Principles and Practice of Constraint Programming - CP 2006,
               12th International Conference, CP 2006, Nantes, France,
               September 25-29, 2006, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4204},
}



@inproceedings{FinkPichlerTompitsWoltran07,
  author    = {Michael Fink and
               Reinhard Pichler and
               Hans Tompits and
               Stefan Woltran},
  title     = {Complexity of Rule Redundancy in Non-ground Answer-Set Programming
               over Finite Domains},
  year      = {2007},
  pages     = {123--135},
  editor    = {Chitta Baral and
               Gerhard Brewka and
               John S. Schlipf},
  booktitle     = {Logic Programming and Nonmonotonic Reasoning, 9th International
               Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007,
               Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4483},
  year      = {2007},
}


% QHORN

@article{BorosCramaHammer90,
  author    = {Endre Boros and
               Yves Crama and
               Peter L. Hammer},
  title     = {Polynomial-Time Inference of All Valid Implications for
               Horn and Related Formulae},
  journal   = AMAI,
  volume    = {1},
  year      = {1990},
  pages     = {21--32},
}


@article {BorosHammerSun94,
    author = {Boros, Endre and Hammer, Peter L. and Sun, Xiaorong},
     title = {Recognition of {$q$}-{H}orn formulae in linear time},
   journal = DAM,
    volume = {55},
      year = {1994},
    number = {1},
     pages = {1--13},
}

%VAF

@article {Pollock92,
    author = {Pollock, John L.},
     title = {How to reason defeasibly},
   journal = AI,
    volume = {57},
      year = {1992},
    number = {1},
     pages = {1--42},
}

@article {BondarenkoDungKowalskiToni97,
    author = {Bondarenko, A. and Dung, P. M. and Kowalski, R. A. and Toni,
              F.},
     title = {An abstract, argumentation-theoretic approach to default
              reasoning},
   journal = AI,
    volume = {93},
      year = {1997},
    number = {1-2},
     pages = {63--101},
}

@incollection {Nute94,
    author = {Nute, Donald},
     title = {Defeasible logic},
 BOOKTITLE = {Handbook of logic in artificial intelligence and logic
              programming, {V}ol.\ 3},
    SERIES = {Oxford Sci. Publ.},
     PAGES = {353--395},
 PUBLISHER = {Oxford Univ. Press},
   ADDRESS = {New York},
      YEAR = {1994},
   MRCLASS = {68T27 (03B60 03B65 03B70 68T30)},
  MRNUMBER = {1281427 (95f:68226)},
MRREVIEWER = {Neculai Curteanu},
}
	


@article {ParsonsWooldridgeAmgoud03,
    author = {Parsons, Simon and Wooldridge, Michael and Amgoud, Leila},
     title = {Properties and complexity of some formal inter-agent
              dialogues},
   journal = JLC,
    volume = {13},
      year = {2003},
    number = {3},
     pages = {347--376},
}




@inproceedings{DvorakPichlerWoltran10,
  author    = {Wolfgang Dvor{\'a}k and
               Reinhard Pichler and
               Stefan Woltran},
  title     = {Towards Fixed-Parameter Tractable Algorithms for Argumentation},
  editor    = {Fangzhen Lin and
               Ulrike Sattler and
               Miroslaw Truszczynski},
  booktitle     = {Principles of Knowledge Representation and Reasoning:
                  Proceedings of the Twelfth International Conference,
                  KR 2010, Toronto, Ontario, Canada, May 9-13, 2010},
  publisher = {AAAI Press},
  year      = {2010},
}




@InProceedings{Dunne10,
  author = 	 {Paul E. Dunne},
  title = 	 {Tractability in Value-based Argumentation},
  booktitle = {Computational Models of Argumentation, Proceedings of
                  COMMA 2010},  
pages = 	 {195--206},
  year = 	 {2010},
  editor = 	 {Pietro Baroni and Federico Cerutti and Massimiliano Giacomin and Guillermo R. Simari},
  volume = 	 {216},
  series = 	 {Frontiers in Artificial Intelligence and Applications},
 organization = {IOS},

}
	

@book{BesnardHunter08,
 author = {Besnard, Philippe and Hunter, Anthony},
 title = {Elements of Argumentation},
 year = {2008},
 publisher = {The MIT Press},
 }



@book{RahwanSimari09,
 editor = {Rahwan, Iyad and Simari, Guillermo R.},
 title = {Argumentation in Artificial Intelligence},
 year = 2009,
 publisher = Springer,
 }




@article {MarekTruszczynski91,
    author = {Marek, Wiktor and Truszczy{\'n}ski, Miros{\l}aw},
     title = {Autoepistemic logic},
   journal = JACM,
    volume = {38},
      year = {1991},
    number = {3},
     pages = {588--619},
}


@article {EiterGottlob95,
    author = {Eiter, Thomas and Gottlob, Georg},
     title = {On the computational cost of disjunctive logic programming:
              propositional case},
   journal = AMAI,
    volume = {15},
      year = {1995},
    number = {3-4},
     pages = {289--323},
}
	

@inproceedings {DowneyFellows92,
    author = {Downey, Rod G. and Fellows, Michael R.},
     title = {Fixed-parameter tractability and completeness},
 booktitle = {Proceedings of the {T}wenty-first {M}anitoba {C}onference on
              {N}umerical {M}athematics and {C}omputing ({W}innipeg, {MB},
              1991)},
   journal = CongrNumer,
    volume = {87},
      year = {1992},
     pages = {161--178},
}


@article {ChenFlum08,
    author = {Chen, Yijia and Flum, J{\"o}rg},
     title = {The parameterized complexity of maximality and minimality
              problems},
   journal = APAL,
    volume = {151},
      year = {2008},
    number = {1},
     pages = {22--61},
}



@inproceedings{BodlaenderThomasseYeo09,
  author    = {Hans L. Bodlaender and
               St{\'e}phan Thomass{\'e} and
               Anders Yeo},
  title     = {Kernel Bounds for Disjoint Cycles and Disjoint Paths},
  pages     = {635--646},
  editor    = {Amos Fiat and
               Peter Sanders},
  booktitle     = {Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen,
               Denmark, September 7-9, 2009. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {5757},
  year      = {2009},
}


@inproceedings{FortnowSanthanam08,
  author    = {Lance Fortnow and
               Rahul Santhanam},
  title     = {Infeasibility of instance compression and succinct {PCPs}
               for {NP}},
  pages     = {133--142},
  editor    = {Cynthia Dwork},
  booktitle     = {Proceedings of the 40th Annual ACM Symposium on Theory of
               Computing, Victoria, British Columbia, Canada, May 17-20,
               2008},
  publisher = {ACM},
  year      = {2008},
}

@inproceedings{BessiereEtAl04,
  author    = {Christian Bessi{\`e}re and
               Emmanuel Hebrard and
               Brahim Hnich and
               Toby Walsh},
  title     = {The Complexity of Global Constraints},
  pages     = {112--117},
  editor    = {Deborah L. McGuinness and
               George Ferguson},
  booktitle     = {Proceedings of the Nineteenth National Conference on
                  Artificial Intelligence, 
                  July 25-29, 2004, San Jose, California, USA},
  publisher = {AAAI Press / The MIT Press},
  year      = {2004},
}


@Article{Stockmeyer73,
  author = 	 {Larry Stockmeyer},
  title = 	 {Planar 3-Colorability is Polynomial Complete},
  journal = 	 {SIGACT News},
  year = 	 {1973},
  pages = 	 {19--25},
}


@article {KaplanShamir94,
    author = {Kaplan, Haim and Shamir, Ron},
     title = {The domatic number problem on some perfect graph families},
   journal = IPL,
    volume = {49},
      year = {1994},
    number = {1},
     pages = {51--56},
}
	

@article {Yap83,
    author = {Yap, Chee-K.},
     title = {Some consequences of nonuniform conditions on uniform classes},
   journal = TCS,
    volume = {26},
      year = {1983},
    number = {3},
     pages = {287--300},
}
	

@article {Cooper90,
    author = {Cooper, Gregory F.},
     title = {The computational complexity of probabilistic inference using
              {B}ayesian belief networks},
   journal = AI,
    volume = {42},
      year = {1990},
    number = {2-3},
     pages = {393--405},
}
		

@inproceedings{Mitchell03,
  author    = {David G. Mitchell},
  title     = {Resolution and Constraint Satisfaction},
  pages     = {555--569},
  editor    = {Francesca Rossi},
  booktitle     = {Principles and Practice of Constraint Programming - CP 2003,
               9th International Conference, CP 2003, Kinsale, Ireland,
               September 29 - October 3, 2003, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {2833},
  year      = {2003},
}



@inproceedings {PudlakImpagliazzo00,
    author = {Pudl{\'a}k, Pavel and Impagliazzo, Russell},
     title = {A lower bound for {DLL} algorithms for {$k$}-{SAT}
              (preliminary version)},
 booktitle = {Proceedings of the {E}leventh {A}nnual {ACM}-{SIAM}
              {S}ymposium on {D}iscrete {A}lgorithms ({S}an {F}rancisco,
              {CA}, 2000)},
     pages = {128--136},
 publisher = {ACM},
      year = {2000},
}

@incollection{GomesKautzSabharwalSelman08,
  author= {Gomes, Carla P. and Kautz, Henry and Sabharwal, 
   Ashish and Selman, Bart},
  title={Satisfiability Solvers},
  pages={89--134},
  booktitle={Handbook of Knowledge Representation},
  editors={{van Harmelen}, Frank and Lifschitz, Vladimir and Porter, Bruce},
  series={Foundations of Artificial Intelligence},
  volume={3},
  year={2008},
  publisher={Elsevier},
}


@inproceedings{JaklPichlerWoltran09,
  author    = {Michael Jakl and
               Reinhard Pichler and
               Stefan Woltran},
  title     = {Answer-Set Programming with Bounded Treewidth},
  pages     = {816--822},
  editor    = {Craig Boutilier},
  booktitle     = {IJCAI 2009, Proceedings of the 21st International Joint
               Conference on Artificial Intelligence, Pasadena, California,
               USA, July 11-17, 2009},
  year      = {2009},
}



@InCollection{MarekTruszczynski99,
  author = 	 {V. Wiktor Marek and
               Miroslaw Truszczynski},
  title = 	 {Stable models and an alternative logic programming paradigm},
  booktitle = 	 {The Logic Programming Paradigm: a 25-Year Perspective},
  pages = 	 {169--181},
  publisher = {Springer},
  year = 	 {1999},
}


@article {Niemela99,
    author = {Niemel{\"a}, Ilkka},
     title = {Logic programs with stable model semantics as a constraint
              programming paradigm},
      note = {Logic programming with non-monotonic semantics: representing
              knowledge and its computation},
   journal = AMAI,
    volume = {25},
      year = {1999},
    number = {3-4},
     pages = {241--273},
}


@article{BeneliyahuDechter94,
	author = {Ben-Eliyahu, R. and Dechter, R.},
	journal = amai,
	number = {1},
	pages = {53--87},
	publisher = Springer,
	title = {Propositional semantics for disjunctive logic programs},
	volume = {12},
	year = {1994},
}


@inproceedings{KottlerKaufmannSinz08,
  author    = {Stephan Kottler and
               Michael Kaufmann and
               Carsten Sinz},
  title     = {A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors},
  pages     = {161--167},
  editor    = {Hans Kleine B{\"u}ning and
               Xishun Zhao},
  booktitle     = {Theory and Applications of Satisfiability Testing - SAT
               2008, 11th International Conference, SAT 2008, Guangzhou,
               China, May 12-15, 2008. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4996},
  year      = {2008},
}


@article{GelfondLifschitz91,
	author = {Michael Gelfond and Vladimir Lifschitz},
	journal = {New Generation Comput.},
	number = {3/4},
	pages = {365--386},
	title = {Classical Negation in Logic Programs and Disjunctive Databases},
	volume = {9},
	year = {1991},
}


@inbook{AptBlairWalker88,
    Author = {Krzysztof R. Apt and Howard A. Blair and Adrian Walker},
    Book = {Foundations of deductive databases and logic programming},
    Pages = {89--148},
    Publisher = {Morgan Kaufmann Publishers Inc.},
    Title = {Towards a theory of declarative knowledge},
    Year = {1988}
}










@article{Ben-Eliyahu96,
	Author = {Rachel Ben-Eliyahu},
	Journal = JAIR,
	Pages = {27--52},
	Title = {A Hierarchy of Tractable Subsets for Computing Stable Models},
	Volume = {5},
	Year = {1996},
}



@inproceedings{LinZhao04,
	author = {Fangzhen Lin and Xishun Zhao},
	booktitle = {Proceedings of the 19th national conference on Artifical intelligence (AAAI 04)},
	editor = {Anthony G. Cohn},
	pages = {80--85},
	publisher = {AAAI Press},
	title = {On Odd and Even Cycles in Normal Logic Programs},
	year = {2004},
}


@inproceedings{DowneyFellowsStege99,
  author = {R. Downey and M. R. Fellows and U. Stege},
  title = {Parameterized Complexity: A Framework for Systematically Confronting
	Computational Intractability},
  booktitle = {Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA
	to the Future},
  year = 1999,
  volume = 49,
  series = {AMS-DIMACS},
  pages = {49--99},
  publisher = AMS
}

@article{DrakeFrischLynceMarquessilvaWalsh02,
	title = {Comparing {SAT} preprocessing techniques},
	author = {Drake, L. and Frisch, A. and Lynce, I. and Marques-Silva, J. P. and Walsh, T.},
	year = {2002},
	url = {http://eprints.ecs.soton.ac.uk/12262/1/jpms-arw02.ps},
	institution = {University of Southampton},
}



@inproceedings{GebserKaufmannNeumannSchaub08,
  author    = {Martin Gebser and
               Benjamin Kaufmann and
               Andr{\'e} Neumann and
               Torsten Schaub},
  title     = {Advanced Preprocessing for Answer Set Solving},
  year      = {2008},
  pages     = {15--19},
  editor    = {Malik Ghallab and
               Constantine D. Spyropoulos and
               Nikos Fakotakis and
               Nikolaos M. Avouris},
  booktitle     = {ECAI 2008 - 18th European Conference on Artificial Intelligence,
               Patras, Greece, July 21-25, 2008, Proceedings},
  publisher = {IOS Press},
  series    = {Frontiers in Artificial Intelligence and Applications},
  volume    = {178},
}





@inproceedings{FernauEal09,
  author    = {Henning Fernau and
               Fedor V. Fomin and
               Daniel Lokshtanov and
               Daniel Raible and
               Saket Saurabh and
               Yngve Villanger},
  title     = {Kernel(s) for Problems with No Kernel: On Out-Trees with
               Many Leaves},
  pages     = {421--432},
  editor    = {Susanne Albers and
               Jean-Yves Marion},
  booktitle     = {26th International Symposium on Theoretical Aspects of Computer
               Science, STACS 2009, February 26-28, 2009, Freiburg, Germany,
               Proceedings},
  publisher = LZI,
  series    = LIPIcs,
  volume    = {3},
  year      = {2009},
}


@article {KutzElbassioniKatrielMahajan08,
    author = {Kutz, Martin and Elbassioni, Khaled and Katriel, Irit and
              Mahajan, Meena},
     title = {Simultaneous matchings: hardness and approximation},
   journal = JCSS,
    volume = {74},
      year = {2008},
    number = {5},
     pages = {884--897},
}



@inproceedings{Fomin10,
  author    = {Fedor V. Fomin},
  title     = {Kernelization},
  pages     = {107--108},
  editor    = {Farid M. Ablayev and
               Ernst W. Mayr},
  booktitle     = {Computer Science - Theory and Applications, 5th International
               Computer Science Symposium in Russia, CSR 2010, Kazan, Russia,
               June 16-20, 2010. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {6072},
  year      = {2010},
}


@InCollection{Rosamond10,
  title = 	 {Table of Races},
  booktitle = 	 {Parameterized Complexity Newsletter},
  pages = 	 {4--5},
  year = 	 {2010},
  author = 	 {Frances Rosamond},
  note = 	 {\url{http://fpt.wikidot.com/}},
}


@article {DimopoulosTorres96,
    author = {Dimopoulos, Yannis and Torres, Alberto},
     title = {Graph theoretical structures in logic programs and default
              theories},
   journal = TCS,
    volume = {170},
      year = {1996},
    number = {1-2},
     pages = {209--244},
}



@article {DunneBenchcapon02,
    author = {Dunne, Paul E. and Bench-Capon, T. J. M.},
     title = {Coherence in finite argument systems},
   journal = AI,
    volume = {141},
      year = {2002},
    number = {1-2},
     pages = {187--203},
}

@inproceedings{CostemarquisDevredMarquis05,
  author    = {Sylvie Coste-Marquis and
               Caroline Devred and
               Pierre Marquis},
  title     = {Symmetric Argumentation Frameworks},
  year      = {2005},
  pages     = {317--328},
  editor    = {Lluis Godo},
  booktitle  = {Symbolic and Quantitative Approaches to 
               Reasoning with Uncertainty,
               8th European Conference, ECSQARU 2005, Barcelona, Spain,
               July 6-8, 2005, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {3571},
}



@inproceedings{MccuaigRobertsonSeymourThomas97,
  author    = {William McCuaig and
               Neil Robertson and
               Paul D. Seymour and
               Robin Thomas},
  title     = {Permanents, Pfaffian Orientations, and Even Directed Circuits
               (Extended Abstract)},
  booktitle = {STOC'97, El Paso, texas, USA},
  year      = {1997},
  pages     = {402--405},
}

@article {RobertsonSeymourThomas99,
    author = {Robertson, Neil and Seymour, P. D. and Thomas, Robin},
     title = {Permanents, {P}faffian orientations, and even directed
              circuits},
   journal = {Ann. of Math. (2)},
    volume = {150},
      year = {1999},
    number = {3},
     pages = {929--975},
}
		






@inproceedings{DvorakWoltran10b,
 author = {Wolfgang {Dvo\v r\'ak} and Stefan Woltran},
 title = {On the Intertranslatability of Argumentation Semantics},
 booktitle = {In Proceedings of the Conference on Thirty Years of Nonmonotonic
            Reasoning(NonMon@30)},
 year = {2010},
 address = {Lexington, KY, USA},
}

@techreport{DunneBenchcapon01,
    author = {Paul E. Dunne and Trevor J. M. Bench-Capon},
    title = {Complexity and Combinatorial Properties of Argument Systems},
    institution = {University of Liverpool},
    year = {2001}
}






@techreport{CyganPilipczukPilipczukWojtaszczyk10,
	Author = {Marek Cygan and Marcin Pilipczuk and 
        Micha{\l} Pilipczuk and Jakub Onufry Wojtaszczyk},
	Institution = {arXiv},
	Note = {\url{http://arxiv.org/abs/1004.2972}},
	Title = {Subset feedback vertex set is fixed parameter tractable},
	Year = {2010}}







@inproceedings{AyariBasin00,
	Author = {Ayari, Abdelwaheb and Basin, David},
	Booktitle = {Computer Aided Verification},
	Editor = {Emerson, E. and Sistla, A.},
	Pages = {99--112},
	Publisher = Springer,
	Series = Lncs,
	Title = {Bounded Model Construction for Monadic Second-Order Logics},
	Volume = {1855},
	Year = {2000},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/10722167_11}}



@techreport{Schaub08,
	Author = {Torsten Schaub},
	Institution = {University of Potsdam},
	Note = {Available at \url{http://www.cs.uni-potsdam.de/~torsten/asp/}},
	Title = {Collection on Answer Set Programming (ASP) and more},
	Year = {2008}}

@techreport{KawarabayashiKobayashi10,
	Author = {Kenichi Kawarabayashi and Yusuke Kobayashi},
	Institution = {University of Tokyo, Japan},
	Title = {Fixed-parameter tractability for the subset feedback set problem and the s-cycle packing problem},
	Year = {2010},
        note = {see also \cite{KakimuraKawarabayashKobayashi12}},
}


@article{SinzKaiserKuchlin03,
	Author = {Sinz, C. and Kaiser, A. and K{\"u}chlin, W.},
	Journal = {Artificial Intelligence for Engineering Design, Analysis and Manufacturing (AI EDAM)},
	Number = {01},
	Pages = {75--97},
	Publisher = camup,
	Title = {{Formal methods for the validation of automotive product configuration data}},
	Volume = {17},
	Year = {2003},
          }


@article{MarateaRiccaFaberLeone08,
	Author = {Marco Maratea and Francesco Ricca and Wolfgang Faber 
       and Nicola Leone},
	Journal = jalg,
	Keywords = {Heuristics},
	Number = {1-3},
	Pages = {70--89},
	Title = {Look-back techniques and heuristics in {D}{L}{V}: 
        Implementation, evaluation, and comparison to {Q}{B}{F} solvers},
	Volume = {63},
	Year = {2008},
}



@inproceedings{ZhaoLin03,
  author    = {Yuting Zhao and
               Fangzhen Lin},
  title     = {Answer Set Programming Phase Transition: A Study on Randomly
               Generated Programs},
  year      = {2003},
  pages     = {239--253},
  editor    = {Catuscia Palamidessi},
  booktitle     = {Logic Programming, 19th International Conference, ICLP 2003,
               Mumbai, India, December 9-13, 2003, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {2916},
}

@inproceedings{Caminada06,
  author    = {Martin Caminada},
  title     = {On the Issue of Reinstatement in Argumentation},
  year      = {2006},
  pages     = {111--123},
  editor    = {Michael Fisher and
               Wiebe van der Hoek and
               Boris Konev and
               Alexei Lisitsa},
  booktitle     = {Logics in Artificial Intelligence, 10th European Conference,
               JELIA 2006, Liverpool, UK, September 13-15, 2006, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4160},
}


@InCollection{Dechter10,
  author = 	 {Rina Dechter},
  title = 	 {Constraint Satisfaction},
  booktitle = 	 {The CogNet Library: References Collection},
  publisher = {MIT Press},
  year = 	 {2010}, 
  address = 	 {\url{http://cognet.mit.edu/library/erefs/mitecs/dechter.html}}, 
}




@InCollection{Pearl10,
  author = 	 {Judea Pearl},
  title = 	 {{B}ayesian Networks},
  booktitle = 	 {The CogNet Library: References Collection},
  publisher = {MIT Press},
  year = 	 {2010}, 
  address = 	 {\url{http://cognet.mit.edu/library/erefs/mitecs/pearl.html}}, 
}


@inproceedings{BessiereHebrardHnichKiziltanWalsh05,
  author    = {Christian Bessi{\`e}re and
               Emmanuel Hebrard and
               Brahim Hnich and
               Zeynep Kiziltan and
               Toby Walsh},
  title     = {Among, Common and Disjoint Constraints},
  pages     = {29--43},
  editor    = {Brahim Hnich and
               Mats Carlsson and
               Fran\c{c}ois Fages and
               Francesca Rossi},
  booktitle     = {Recent Advances in Constraints, Joint ERCIM/CoLogNET International
               Workshop on Constraint Solving and Constraint Logic Programming,
               CSCLP 2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected
               and Invited Papers},
  publisher = Springer,
  series    = LNCS,
  volume    = {3978},
  year      = {2006},
}


@article{BessiereHebrardHnichKiziltanWalsh09,
  author    = {Christian Bessi{\`e}re and
               Emmanuel Hebrard and
               Brahim Hnich and
               Zeynep Kiziltan and
               Toby Walsh},
  title     = {Range and Roots: Two common patterns for specifying and
               propagating counting and occurrence constraints},
  journal   = AI,
  volume    = {173},
  number    = {11},
  year      = {2009},
  pages     = {1054--1078},
}



@InCollection{FrancoMartin09,
  author = 	 {John Franco and John Martin},
  title = 	 {A History of Satisfiabilty},
  booktitle = 	 {Handbook of Satisfiability},
  publisher =  {IOS Press},
  year = 	 {2009},
  editor = 	 {Armin Biere and Marijn Heule and 
                    Hans van Maaren and Toby Walsh},
  chapter = 	 {1},
  pages =        {3--97},
}

@InCollection{Speckenmeyer09,
  author = 	 {Ewald Speckenmeyer},
  title = 	 {Classes of Easy Expressions},
  booktitle = 	 {Handbook of Satisfiability},
  publisher =  {IOS Press},
  year = 	 {2009},
  editor = 	 {Armin Biere and Marijn Heule and 
                    Hans van Maaren and Toby Walsh},
  chapter = 	 {13, Section 1.19},
  pages =        {27--31},
}

@article{BrandstadtLozin03,
  author    = {Andreas Brandst{\"a}dt and
               Vadim {V. Lozin}},
  title     = {On the linear structure and clique-width of bipartite permutation
               graphs},
  journal   = {Ars Combinatoria},
  volume    = {67},
  pages = {273-–281},
  year      = {2003}
}


@article{BodlaenderKoster08,
  author    = {Hans L. Bodlaender and
               Arie M. C. A. Koster},
  title     = {Combinatorial Optimization on Graphs of Bounded Treewidth},
  journal   = TCJ,
  volume    = {51},
  number    = {3},
  year      = {2008},
  pages     = {255--269},
}




@book{vanHarmelenLifschitzPorter08,
  pages={89--134},
  title={Handbook of Knowledge Representation},
  editor={{van Harmelen}, Frank and Lifschitz, Vladimir and Porter, Bruce},
  series={Foundations of Artificial Intelligence},
  volume={3},
  year={2008},
  publisher={Elsevier},
}

@book {BrandstadtLeSpinrad99,
    author = {Brandst{\"a}dt, Andreas and Le, Van Bang and Spinrad, Jeremy
              P.},
     title = {Graph classes: a survey},
    series = {SIAM Monographs on Discrete Mathematics and Applications},
 publisher = {SIAM},
   address = {Philadelphia, PA},
      year = {1999},
}

@incollection {KloksBodlaender92,
    author = {Kloks, Ton and Bodlaender, Hans},
     title = {Approximating treewidth and pathwidth of some classes of
              perfect graphs},
 booktitle = {Algorithms and computation ({N}agoya, 1992)},
    series = LNCS,
    volume = {650},
     pages = {116--125},
 publisher = Springer,
      year = {1992},
}
		



@inproceedings{GanianHlinenyObdrzalek10,
  author    = {Robert Ganian and
               Petr Hlinen{\'y} and
               Jan Obdrz{\'a}lek},
  title     = {Better Algorithms for Satisfiability Problems for Formulas
               of Bounded Rank-width},
  pages     = {73--83},
  editor    = {Kamal Lodaya and
               Meena Mahajan},
  booktitle     = {IARCS Annual Conference on Foundations of Software Technology
               and Theoretical Computer Science, FSTTCS 2010, December
               15-18, 2010, Chennai, India},
  publisher = LZI,
  series    = LIPIcs,
  volume    = {8},
  year      = {2010},
}





@InProceedings{DellMelkebeek10,
  author = 	 {Holger Dell and Dieter van Melkebeek},
  title = 	 {Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses},
  booktitle = {STOC'10, Proceedings of the 42nd ACM symposium on Theory
                  of computing},
  pages = 	 {251--260},
  year = 	 {2010},
  publisher = ACM,
}



@InCollection{ModgilCaminada09,
  author = 	 {Sanjay Modgil and  Martin Caminada},
  title = 	 {Proof Theories and Algorithms for Abstract 
                  Argumentation Frameworks},
  booktitle = 	 {Argumentation in Artificial Intelligence},
  pages = 	 {105--132},
  publisher = Springer,
  year = 	 {2009},
  editor = 	 {Rahwan, Iyad and Simari, Guillermo},
}



@ARTICLE{CesatiDiIanni97,
  author = {Marco Cesati and Miriam Di Ianni},
  title = {Computation Models for Parameterized Complexity},
  journal = MLQ,
  year = {1997},
  volume = {43},
  pages = {179--202},
}



@INPROCEEDINGS{Briandais59,
  author = {De La Briandais, Rene},
  title = {File searching using variable length keys},
  booktitle = {Papers presented at the the March 3-5, 1959, Western
                  Joint Computer Conference},
  year = {1959},
  series = {IRE-AIEE-ACM '59 (Western)},
  pages = {295--298},
  address = {New York, NY, USA},
  publisher = {ACM},
  doi = {10.1145/1457838.1457895},
  location = {San Francisco, California},
}



@INPROCEEDINGS{DowneyFellowsMcCartin06,
  author = {Rodney G. Downey and Michael R. Fellows and Catherine McCartin},
  title = {Parameterized Approximation Problems},
  booktitle = {Parameterized and Exact Computation, Second International
                  Workshop, IWPEC 2006},
  year = {2006},
  volume = {4169},
  series = LNCS,
  pages = {121--129},
  publisher = Springer,
}



@ARTICLE{Fredkin60,
  author = {Fredkin, Edward},
  title = {Trie memory},
  journal = ComACM,
  year = {1960},
  volume = {3},
  pages = {490--499},
  address = {New York, NY, USA},
  issue = {9},
  publisher = {ACM},
}


@article {DechterPearl87,
    author = {Dechter, Rina and Pearl, Judea},
     title = {Network-based heuristics for constraint-satisfaction problems},
   journal = AI,
    volume = {34},
      year = {1987},
    number = {1},
     pages = {1--38},
}



@article {Montanari74,
    author = {Montanari, Ugo},
     title = {Networks of constraints: fundamental properties and
              applications to picture processing},
   journal = InfSci,
    volume = {7},
      year = {1974},
     pages = {95--132},
}
	
@article {Freuder78,
    author = {Freuder, Eugene C.},
     title = {Synthesizing constraint expressions},
   journal = ComACM,
    volume = {21},
      year = {1978},
    number = {11},
     pages = {958--966},
}


@article {Mackworth77,
    author = {Mackworth, Alan K.},
     title = {Consistency in networks of relations},
   journal = AI,
    volume = {8},
      year = {1977},
     pages = {99--118},
}


@article {Cooper89,
    author = {Cooper, Martin C.},
     title = {An optimal {$k$}-consistency algorithm},
   journal = AI,
    volume = {41},
      year = {1989},
    number = {1},
     pages = {89--95},
}




@inproceedings{EenBiere05,
  author    = {Niklas E{\'e}n and Armin Biere},
  title     = {Effective Preprocessing in {SAT} Through Variable and Clause
               Elimination},
  year      = {2005},
  pages     = {61--75},
  editor    = {Fahiem Bacchus and
               Toby Walsh},
  booktitle     = {Theory and Applications of Satisfiability Testing,
                  8th International Conference, SAT 2005, St. Andrews,
                  UK, June 19-23, 2005, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {3569},
}



@article {CadoliDoniniLiberatore02,
   author = {Cadoli, Marco and Donini, Francesco M. and Liberatore, Paolo
              and Schaerf, Marco},
     title = {Preprocessing of intractable problems},
   journal = InfComp,
    volume = {176},
      year = {2002},
    number = {2},
     pages = {89--120},
}


@inproceedings{AtseriasBulatovDalmau07,
  author    = {Albert Atserias and
               Andrei A. Bulatov and
               V\'{\i}ctor Dalmau},
  title     = {On the Power of {\it k}-Consistency},
  year      = {2007},
  pages     = {279--290},
  editor    = {Lars Arge and
               Christian Cachin and
               Tomasz Jurdzinski and
               Andrzej Tarlecki},
  booktitle     = {Automata, Languages and Programming, 34th International
               Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007,
               Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4596},
}

@article {Dechter92a,
    author = {Dechter, Rina},
     title = {From local to global consistency},
   journal = AI,
    volume = 55,
      year = 1992,
    number = 1,
     pages = {87--107},
}
	

@article{KomusiewiczNiedermeierUhlmann11,
  author    = {Christian Komusiewicz and
               Rolf Niedermeier and
               Johannes Uhlmann},
  title     = {Deconstructing intractability - A multivariate complexity
               analysis of interval constrained coloring},
  journal   = JDA,
  volume    = {9},
  number    = {1},
  year      = {2011},
  pages     = {137--151},
}




@article {RazgonOSullivan09,
    author = {Razgon, Igor and O'Sullivan, Barry},
     title = {Almost 2-{SAT} is fixed parameter tractable},
   journal = JCSS,
    volume = {75},
      year = {2009},
    number = {8},
     pages = {435--450},
}



@article{MakinoTamakiYamamoto11,
  author    = {Kazuhisa Makino and
               Suguru Tamaki and
               Masaki Yamamoto},
  title     = {Derandomizing {HSSW} Algorithm for {3-SAT}},
  journal   = {CoRR},
  volume    = {abs/1102.3766},
  year      = {2011},
}


 

@InProceedings{Fichte11,
  author = 	 {Johannes Klaus Fichte},
  title = 	 {The Good, the Bad, and the Odd: Cycles in Answer-Set Programs},
  booktitle = {ESSLII 2011},
  year     = {2011},
}



@inproceedings{PanVardi06,
  author    = {Guoqiang Pan and
               Moshe Y. Vardi},
  title     = {Fixed-Parameter Hierarchies inside {PSPACE}},
  pages     = {27--36},
  booktitle     = {21th IEEE Symposium on Logic in Computer Science (LICS 2006),
               12-15 August 2006, Seattle, WA, USA, Proceedings},
  publisher = {IEEE Computer Society},
  year      = {2006},
}


@article{Levin73,
  author = {Leonid Levin},
  title = {Universal sequential search problems},
  journal = {Problems of Information Transmission},
  year = {1973},
  volume = {9},
  pages = {265-–266},
  number = {3},
}





@TechReport{GutinYeo11,
  author = 	 {Gregory Gutin and Anders Yeo},
  title = 	 {Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey},
  institution =  {arXiv},
  year = 	 {2011},
  number = 	 {1108.4803v1},
}





@article{Bodlaender94,
  author = {Hans L. Bodlaender},
  title = {On Disjoint Cycles},
  journal = {International Journal of Foundations of Computer Science},
  year = {1994},
  volume = {5},
  pages = {59--68},
  number = {1},
}



@article{RamanSaurabhSubramanian06,
  author = {Venkatesh Raman and Saket Saurabh and C. R. Subramanian},
  title = {Faster fixed parameter tractable algorithms for finding feedback
	vertex sets},
  journal = TALG,
  year = {2006},
  volume = {2},
  pages = {403--415},
  number = {3},
}




@article{ChenFominLiuLuVillanger08,
  author = {Jianer Chen and Fedor V. Fomin and Yang Liu and Songjian Lu and Yngve
	Villanger},
  title = {Improved algorithms for feedback vertex set problems},
  journal = JCSS,
  year = {2008},
  volume = {74},
  pages = {1188--1198},
  number = {7},
}

@inproceedings{MishraRSSS07,
  author = {Sounaka Mishra and Venkatesh Raman and Saket Saurabh and Somnath
	Sikdar and C. R. Subramanian},
  title = {The Complexity of Finding Subgraphs Whose Matching Number Equals
	the Vertex Cover Number},
  booktitle = {Proceedings of the 18th International Symposium on Algorithms and
	Computation (ISAAC 2007)},
  year = {2007},
  volume = {4835},
  series = LNCS,
  pages = {268--279},
  publisher = Springer,
}


@article{CaiHuang10,
  author = {Liming Cai and Xiuzhen Huang},
  title = {Fixed-Parameter Approximation: Conceptual Framework and Approximability
	Results},
  journal = Alg,
  year = {2010},
  volume = {57},
  pages = {398--412},
  number = {2},
}



@inproceedings{ChenGroheGruebnerG06,
  author = {Yijia Chen and Martin Grohe and Magdalena Gr{\"u}ber},
  title = {On Parameterized Approximability},
  booktitle = {Proceedings of the 2nd International Workshop on Parameterized and
	Exact Computation (IWPEC 2006)},
  year = {2006},
  volume = {4169},
  series = LNCS,
  pages = {109--120},
  publisher = Springer,
}




@article{Abukhzam10,
  author = {Faisal N. Abu-Khzam},
  title = {A kernelization algorithm for d-Hitting Set},
  journal = JCSS,
  year = {2010},
  volume = {76},
  pages = {524--531},
  number = {7},
}


@inproceedings{CyganPilipczukPilipczukWojtaszczyk11,
   author = {Marek Cygan and Marcin Pilipczuk and Michal Pilipczuk and Jakub Onufry
	Wojtaszczyk},
  title = {Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
  booktitle = {Proceedings of the 38th International Colloquium on Automata, Languages
	and Programming (ICALP 2011)},
  year = {2011},
  volume = {6755},
  series = LNCS,
  pages = {449--461},
  publisher = Springer,
}



@inproceedings{LiBeek11,
  author = {Zijie Li and Peter van Beek},
  title = {Finding Small Backdoors in {S}{A}{T} Instances},
  booktitle = {Proceedings of the 24th Canadian Conference on Artificial Intelligence
	(AI 2011)},
  year = {2011},
  editor = {Cory J. Butz and Pawan Lingras},
  volume = {6657},
  series = LNCS,
  pages = {269--280},
  publisher = Springer,
}



@inproceedings{LeberreParrain08,
  author    = {Daniel Le Berre and
               Anne Parrain},
  title     = {On {SAT} Technologies for Dependency Management and Beyond},
  pages     = {197--200},
  editor    = {Steffen Thiel and
               Klaus Pohl},
  booktitle     = {Software Product Lines, 12th International Conference, SPLC
               2008, Limerick, Ireland, September 8-12, 2008, Proceedings.
               Second Volume (Workshops)},
  publisher = {Lero Int. Science Centre, University of Limerick, Ireland},
  year      = {2008},
}


@article {ChenGimenez10,
    Author = {Chen, Hubie and Gim{\'e}nez, Omer},
     title = {Causal graphs and structurally restricted planning},
   journal = JCSS,
    volume = {76},
      year = {2010},
    number = {7},
     pages = {579--592},
}


@article{Knoblock94,
  author    = {Craig A. Knoblock},
  title     = {Automatically Generating Abstractions for Planning},
  journal   = AI,
  volume    = {68},
  number    = {2},
  year      = {1994},
  pages     = {243--302},
}

@inproceedings{BrafmanDomshlak06,
  author    = {Ronen I. Brafman and
               Carmel Domshlak},
  title     = {Factored Planning: How, When, and When Not},
  year      = {2006},
  booktitle     = {Proceedings, The Twenty-First National Conference on Artificial
               Intelligence and the Eighteenth Innovative Applications
               of Artificial Intelligence Conference, July 16-20, 2006,
               Boston, Massachusetts, USA},
  publisher = {AAAI Press},
}




@article{BlumFurst97,
  author    = {Avrim Blum and
               Merrick L. Furst},
  title     = {Fast Planning Through Planning Graph Analysis},
  journal   = AI,
  volume    = {90},
  number    = {1-2},
  year      = {1997},
  pages     = {281--300},
}


@inproceedings{KambhampatiNigenda00,
  author    = {Subbarao Kambhampati and
               Romeo Sanchez Nigenda},
  title     = {Distance-Based Goal-Ordering Heuristics for Graphplan},
  pages     = {315--322},
  editor    = {Steve Chien and
               Subbarao Kambhampati and
               Craig A. Knoblock},
  booktitle     = {Proceedings of the Fifth International Conference on Artificial
               Intelligence Planning Systems, Breckenridge, CO, USA, April
               14-17, 2000},
  publisher = {AAAI},
  year      = {2000},
}

@article {JonssonBackstrom98,
    AUTHOR = {Jonsson, Peter and B{\"a}ckstr{\"o}m, Christer},
     TITLE = {State-variable planning under structural restrictions:
              algorithms and complexity},
  journal =  AI,
    volume = 100,
      year = 1998,
    number = {1-2},
     pages = {125--176},
}


@inproceedings{ChenHuangZhang08,
  author    = {Yixin Chen and
               Ruoyun Huang and
               Weixiong Zhang},
  title     = {Fast Planning by Search in Domain Transition Graph},
  pages     = {886--891},
  editor    = {Dieter Fox and
               Carla P. Gomes},
  booktitle     = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17,
               2008},
  publisher = {AAAI Press},
  year      = {2008},
}



@inproceedings{KwisthoutBodlaenderGaag10,
  author    = {Johan Kwisthout and
               Hans L. Bodlaender and
               Linda C. van der Gaag},
  title     = {The Necessity of Bounded Treewidth for Efficient Inference
               in {B}ayesian Networks},
  pages     = {237--242},
  editor    = {Helder Coelho and
               Rudi Studer and
               Michael Wooldridge},
  booktitle     = {ECAI 2010 - 19th European Conference on Artificial Intelligence,
               Lisbon, Portugal, August 16-20, 2010, Proceedings},
  publisher = {IOS Press},
  series    = {Frontiers in Artificial Intelligence and Applications},
  volume    = {215},
  year      = {2010},

}




@inproceedings{Praveen10,
  author    = {M. Praveen},
  title     = {Does Treewidth Help in Modal Satisfiability? - (Extended
               Abstract)},
  year      = {2010},
  pages     = {580--591},
  editor    = {Petr Hlinen{\'y} and
               Anton\'{\i}n Kucera},
  booktitle     = {Mathematical Foundations of Computer Science 2010, 35th
               International Symposium, MFCS 2010, Brno, Czech Republic,
               August 23-27, 2010. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {6281}
}

@ARTICLE{Marx08b,
  author = {D{\'a}niel Marx},
  title = {Parameterized Complexity and Approximation Algorithms},
  journal = TCJ,
  year = 2008,
  volume = 51,
  pages = {60--78},
  number = 1,
}
 

@article {RobertsonSeymour85,
    author = {Robertson, Neil and Seymour, P. D.},
     title = {Disjoint paths---a survey},
   journal = SiamJADM,
    volume = {6},
      year = {1985},
    number = {2},
     pages = {300--305},
}
	
@article {ArnborgProskurowskiCorneil90,
    author = {Arnborg, Stefan and Proskurowski, Andrzej and Corneil, Derek
              G.},
     title = {Forbidden minors characterization of partial {$3$}-trees},
   journal = DM,
    volume = {80},
      year = {1990},
    number = {1},
     pages = {1--19},
}


@ARTICLE{Fernau10,
  author = {Henning Fernau},
  title =  {A Top-Down Approach to Search-Trees: 
     Improved Algorithmics for 3-Hitting
	Set},
  journal = Alg,
  year = {2010},
  volume = {57},
  pages = {97--118},
  number = {1},
}



@inproceedings{BonsmaLokshtanov11,
  author    = {Paul Bonsma and
               Daniel Lokshtanov},
  title     = {Feedback Vertex Set in Mixed Graphs},
  pages     = {122--133},
  editor    = {Frank Dehne and
               John Iacono and
               J{\"o}rg-R{\"u}diger Sack},
  booktitle     = {Algorithms and Data Structures - 12th International Symposium,
               WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {6844},
  year      = {2011},
}


@inproceedings{Hertli11,
  author = {Timon Hertli},
  title = {3-{SAT} Faster and Simpler - Unique-{SAT} Bounds for {PPSZ} Hold
	in General},
  booktitle = {Proceedings of the 52nd Annual IEEE Symposium on
                  Foundations of Computer Science (FOCS 2011)},
  editor    = {Rafail Ostrovsky},
  publisher = {IEEE},
  year      = {2011},
}


@inproceedings{KakimuraKawarabayashKobayashi12,
  author    = {Naonori Kakimura and
               Kenichi Kawarabayashi and
               Yusuke Kobayashi},
  title     = {Erd{\"o}s-P{\'o}sa property and its algorithmic applications:
               parity constraints, subset feedback set, and subset packing},
  year      = {2012},
  pages     = {1726--1736},
  editor    = {Yuval Rabani},
  booktitle     = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium
               on Discrete Algorithms, SODA 2012, Kyoto, Japan, January
               17-19, 2012},
  publisher = {SIAM},
 }

@article{BrewkaEiterTruszczynski11,
	Author = {Gerhard Brewka and Thomas Eiter and Miroslaw Truszczynski},
	Journal = ComACM,
	Number = {12},
	Pages = {92--103},
	Title = {Answer set programming at a glance},
	Volume = {54},
	Year = {2011},
}

@inproceedings{NiemelaSimonisSoininen99,
	Author = {Ilkka Niemel{\"a} and Patrik Simons and Timo Soininen},
	Booktitle = {Logic Programming and Nonmonotonic Reasoning, 5th
                  International Conference, LPNMR'99, El Paso, Texas,
                  USA, December 2-4, 1999, Proceedings},
	Editor = {Michael Gelfond and Nicola Leone and Gerald Pfeifer},
	Pages = {317--331},
	Publisher = Springer,
	Series = LNCS,
	Title = {Stable Model Semantics of Weight Constraint Rules},
	Volume = {1730},
	Year = {1999},
}

@inproceedings{Beldiceanu01,
	Author = {Nicolas Beldiceanu},
	Booktitle = {Principles and Practice of Constraint Programming -
                  CP 2001, 7th International Conference, CP 2001,
                  Paphos, Cyprus, November 26 - December 1, 2001,
                  Proceedings},
	Editor = {Toby Walsh},
	Pages = {211--224},
	Publisher = Springer,
	Series = LNCS,
	Title = {Pruning for the Minimum Constraint Family and for the
                  Number of Distinct Values Constraint Family},
	Volume = {2239},
	Year = {2001},
}


@article{MarxSchlotter11,
	Author = {D{\'a}niel Marx and Ildik{\'o} Schlotter},
	Journal = DO,
	Number = {1},
	Pages = {25--40},
	Title = {Stable assignment with couples: Parameterized
                  complexity and local search},
	Volume = {8},
	Year = {2011},
}

@article{AtseriasFichteThurley11,
	Author = {Atserias, Albert and Fichte, Johannes Klaus and
                  Thurley, Marc},
	Journal = JAIR,
	Pages = {353--373},
	Title = {Clause-learning algorithms with many restarts and
                  bounded-width resolution},
	Volume = {40},
	Year = {2011},
}

@inproceedings{VanGelder11,
	Author = {Van Gelder, Allen},
	Booktitle = {Principles and Practice of Constraint Programming - CP 2011},
	Editor = {Lee, Jimmy},
	Pages = {789--803},
	Publisher = Springer,
	Series = LNCS,
	Title = {Variable Independence and Resolution Paths for
                  Quantified Boolean Formulas},
	Volume = {6876},
	Year = {2011},
}

@inproceedings{BeyersdorffGalesiLauriaRazborov11,
	Author = {Olaf Beyersdorff and Nicola Galesi and Massimo Lauria
                  and Alexander A. Razborov},
	Booktitle = {Automata, Languages and Programming - 38th
                  International Colloquium, ICALP 2011, Zurich,
                  Switzerland, July 4-8, 2011, Proceedings, Part I},
	Editor = {Luca Aceto and Monika Henzinger and Jiri Sgall},
	Pages = {630--641},
	Publisher = Springer,
	Series = LNCS,
	Title = {Parameterized Bounded-Depth Frege Is Not Optimal},
	Volume = {6755},
	Year = {2011},
}

@inproceedings{BeyersdorffGalesiLauria11,
	Author = {Olaf Beyersdorff and Nicola Galesi and Massimo Lauria},
	Booktitle = {Theory and Applications of Satisfiability Testing -
                  SAT 2011 - 14th International Conference, SAT 2011,
                  Ann Arbor, MI, USA, June 19-22, 2011. Proceedings},
	Editor = {Karem A. Sakallah and Laurent Simon},
	Pages = {5--18},
	Publisher = Springer,
	Series = LNCS,
	Title = {Parameterized Complexity of {DPLL} Search Procedures},
	Volume = {6695},
	Year = {2011},
}





@inproceedings{GutinJonesYeo11,
  author    = {Gregory Gutin and
               Mark Jones and
               Anders Yeo},
  title     = {A New Bound for 3-Satisfiable Maxsat and Its Algorithmic
               Application},
  pages     = {138--147},
  editor    = {Olaf Owe and
               Martin Steffen and
               Jan Arne Telle},
  booktitle     = {Fundamentals of Computation Theory - 18th International
               Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {6914},
  year      = {2011},

}


@inproceedings{Marx10a,
  author    = {D{\'a}niel Marx},
  title     = {Tractable hypergraph properties for constraint satisfaction
               and conjunctive queries},
  year      = {2010},
  pages     = {735--744},
  editor    = {Leonard J. Schulman},
  booktitle     = {Proceedings of the 42nd ACM Symposium on Theory of Computing,
               STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  publisher = {ACM},
}

@article{Bulatov06,
  author    = {Andrei A. Bulatov},
  title     = {A dichotomy theorem for constraint satisfaction problems
               on a 3-element set},
  journal   = JACM,
  volume    = {53},
  number    = {1},
  year      = {2006},
  pages     = {66--120},
}



@article {ChenKanjXia09,
    author = {Chen, Jianer and Kanj, Iyad A. and Xia, Ge},
     title = {On parameterized exponential time complexity},
   journal = TCS,
    volume = {410},
      year = {2009},
    number = {27-29},
     pages = {2641--2648},
}


@article {PapadimitriouYannakakis91,
    author = {Papadimitriou, Christos H. and Yannakakis, Mihalis},
     title = {Optimization, approximation, and complexity classes},
   journal = JCSS,
    volume = {43},
      year = {1991},
    number = {3},
     pages = {425--440},

}
	
@article {Schuler05,
    author = {Schuler, Rainer},
     title = {An algorithm for the satisfiability problem of formulas in
              conjunctive normal form},
   journal = JAlg,
    volume = {54},
      YEAR = {2005},
    number = {1},
     pages = {40--44},
}
	

@inproceedings{CalabroImpagliazzoPaturi06,
  author    = {Chris Calabro and
               Russell Impagliazzo and
               Ramamohan Paturi},
  title     = {A Duality between Clause Width and Clause Density for {SAT}},
  year      = {2006},
  pages     = {252--260},
  booktitle     = {21st Annual IEEE Conference on Computational Complexity
               (CCC 2006), 16-20 July 2006, Prague, Czech Republic},
  publisher = {IEEE Computer Society},

}


@inproceedings{Freuder90,
  author    = {Eugene C. Freuder},
  title     = {Complexity of K-Tree Structured Constraint Satisfaction
               Problems},
  pages     = {4--9},
  editor    = {Howard E. Shrobe and
               Thomas G. Dietterich and
               William R. Swartout},
  booktitle     = {Proceedings of the 8th National Conference on Artificial
               Intelligence. Boston, Massachusetts, July 29 - August 3,
               1990, 2 Volumes},
  publisher = {AAAI Press / The MIT Press},
  year      = {1990}
 }



@article {ChenEtal05,
    author = {Chen, Jianer and Chor, Benny and Fellows, Mike and Huang,
              Xiuzhen and Juedes, David and Kanj, Iyad A. and Xia, Ge},
     title = {Tight lower bounds for certain parameterized {NP}-hard
              problems},
   journal = InfComp,
    volume = {201},
      year = {2005},
    number = {2},
     pages = {216--231},
}



@inproceedings{JohnsonSzegedy99,
author = {D. Johnson and M. Szegedy},
title = {What are the least tractable instances of max. independent
                  set?},
booktitle = {Proceedings of the sixteenth annual ACM-SIAM symposium on
                  Discrete algorithms (SODA 1999)},
year = {1999},
pages = {927--928}
}


@article {ChenHuangKanjXia06,
    author = {Chen, Jianer and Huang, Xiuzhen and Kanj, Iyad A. and Xia, Ge},
     title = {Strong computational lower bounds via parameterized
              complexity},
   journal = JCSS,
    volume = {72},
      year = {2006},
    number = {8},
     pages = {1346--1367},
}


@inproceedings{Grohe06,
  author    = {Martin Grohe},
  title     = {The Structure of Tractable Constraint Satisfaction Problems},
  pages     = {58--72},
  editor    = {Rastislav Kralovic and
               Pawel Urzyczyn},
  booktitle     = {Mathematical Foundations of Computer Science 2006, 31st
               International Symposium, MFCS 2006, Star{\'a} Lesn{\'a},
               Slovakia, August 28-September 1, 2006, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4162},
  year      = {2006},
}




@article{FordFulkerson56,
    author = {Ford, Jr., L. R. and Fulkerson, D. R.},
     title = {Maximal flow through a network},
   journal = CanJM,
    volume = {8},
      year = {1956},
     pages = {399--404},
}

@inproceedings{CyganEtal12,
  author    = {Marek Cygan and
               Holger Dell and
               Daniel Lokshtanov and
               D{\'a}niel Marx and
               Jesper Nederlof and
               Yoshio Okamoto and
               Ramamohan Paturi and
               Saket Saurabh and
               Magnus Wahlstr{\"o}m},
  title     = {On Problems as Hard as CNF-SAT},
  pages     = {74--84},
  booktitle     = {Proceedings of the 27th Conference on Computational Complexity,
               CCC 2012, Porto, Portugal, June 26-29, 2012},
  publisher = {IEEE},
  year      = {2012},
}


@inproceedings{Traxler08,
  author    = {Patrick Traxler},
  title     = {The Time Complexity of Constraint Satisfaction},
  pages     = {190--201},
  editor    = {Martin Grohe and
               Rolf Niedermeier},
  booktitle     = {Parameterized and Exact Computation, Third International
               Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008.
               Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {5018},
  year      = {2008},
}


@article{LokshtanovMarxSuarabh11,
  author    = {Daniel Lokshtanov and
               D{\'a}niel Marx and
               Saket Saurabh},
  title     = {Lower bounds based on the Exponential Time Hypothesis},
  journal   = BEATCS,
  volume    = {105},
  year      = {2011},
  pages     = {41--72},
}


@article {Marx10b,
    author = {Marx, D{\'a}niel},
     title = {Can you beat treewidth?},
   journal = TC,
    volume = {6},
      year = {2010},
     pages = {85--112},
}


@inproceedings{PachetRoy99,
  author    = {Fran\c{c}ois Pachet and
               Pierre Roy},
  title     = {Automatic Generation of Music Programs},
  pages     = {331--345},
  editor    = {Joxan Jaffar},
  booktitle     = {Principles and Practice of Constraint Programming - CP'99,
               5th International Conference, Alexandria, Virginia, USA,
               October  11-14, 1999, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {1713},
  year      = {1999},
}

@article {BessiereEtal06,
    author = {Bessiere, Christian and Hebrard, Emmanuel and Hnich, Brahim
              and Kiziltan, Zeynep and Walsh, Toby},
     title = {Filtering algorithms for the {NV}alue constraint},
   journal = Cons,
    volume = {11},
      year = {2006},
    number = {4},
     pages = {271--293},
}

@book {CormenLeisersonRivestStein09,
    author = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald
              L. and Stein, Clifford},
     title = {Introduction to Algorithms},
   edition = {Third},
 publisher = {The MIT Press},
   address = {Cambridge, MA},
      year = {2009},
}
	

@book {FominKratsch10,
 author ={F.~V. Fomin and D.~Kratsch},
  title={Exact Exponential Algorithms},
publisher=Springer,
year = {2010},
}


@article {Quine59,
    author = {Quine, W. V.},
     title = {The problem of simplifying truth functions},
   journal = {Amer. Math. Monthly},
    volume = {59},
      year = {1952},
     pages = {521--531},
}

@inproceedings{Berkholz12,
 author    = {Christoph Berkholz},
 title     = {Lower Bounds for Existential Pebble Games and k-Consistency
              Tests},
 booktitle = {Proceedings of the 27th Annual IEEE Symposium on Logic in
              Computer Science (LICS 2012)},
 pages     = {25--34},
  publisher = {IEEE},
 year      = {2012},
 
}

@book{GhallabNauTraverso04,
  author    = {Malik Ghallab and
               Dana S. Nau and
               Paolo Traverso},
  title     = {Automated planning - theory and practice},
  publisher = {Elsevier},
  year      = {2004},
  pages     = {I--XXVIII, 1--635}
}


@article{Bylander94,
  author    = {Tom Bylander},
  title     = {The Computational Complexity of Propositional {STRIPS} Planning},
  journal   = AI,
  volume    = {69},
  number    = {1--2},
  year      = {1994},
  pages     = {165--204}
}



@article{BackstromKlein91,
  author    = {Christer B{\"a}ckstr{\"o}m and
               Inger Klein},
  title     = {Planning in polynomial time: the {SAS-PUBS} class},
  journal   = ComInt,
  volume    = {7},
  year      = {1991},
  pages     = {181--197}
}

@article{JonssonBackstrom98,
  author    = {Peter Jonsson and
               Christer B{\"a}ckstr{\"o}m},
  title     = {State-Variable Planning Under Structural Restrictions: Algorithms
               and Complexity},
  journal   = AI,
  volume    = {100},
  number    = {1--2},
  year      = {1998},
  pages     = {125--176}
}

@article{ChenGimenez10,
  author    = {Hubie Chen and
               Omer Gim{\'e}nez},
  title     = {Causal graphs and structurally restricted planning},
  journal   = JCSS,
  volume    = {76},
  number    = {7},
  year      = {2010},
  pages     = {579--592}
}

@article{BackstromNebel95,
  author    = {Christer B{\"a}ckstr{\"o}m and
               Bernhard Nebel},
  title     = {Complexity Results for {SAS+} Planning},
  journal   = ComInt,
  volume    = {11},
  year      = {1995},
  pages     = {625--656}
}

@article{GuoNiedermeierSuchy11,
  author    = {Jiong Guo and
               Rolf Niedermeier and
               Ondrej Such{\'y}},
  title     = {Parameterized Complexity of Arc-Weighted Directed Steiner
               Problems},
  journal   = SiamJDM,
  volume    = {25},
  number    = {2},
  year      = {2011},
  pages     = {583--599}
}

@article{MisraRamanSaurabh11,
  author    = {Neeldhara Misra and
               Venkatesh Raman and
               Saket Saurabh},
  title     = {Lower bounds on kernelization},
  journal   = {Discrete Optimization},
  volume    = {8},
  number    = {1},
  year      = {2011},
  pages     = {110--128}
}


@incollection{Biere09,
  author    = {Armin Biere},
  title     = {Bounded Model Checking},
  booktitle = {Handbook of Satisfiability},
  pages     = {457--481},
  publisher = {IOS Press},
  series    = {Frontiers in Artificial Intelligence and Applications},
  volume    = {185},
  year      = {2009},
  editor    = {Armin Biere and
               Marijn Heule and
               Hans van Maaren and
               Toby Walsh},
}

@article {FellowsJansenRosamond13,
    author = {Fellows, Michael R. and Jansen, Bart M.P. and Rosamond,
              Frances},
     title = {Towards fully multivariate algorithmics: {P}arameter ecology
              and the deconstruction of computational complexity},
   journal = EJC,
    volume = {34},
      year = {2013},
    number = {3},
     pages = {541--566},
}



@article{CourcelleKante09,
  author    = {Bruno Courcelle and
               Mamadou Moustapha Kant{\'e}},
  title     = {Graph operations characterizing rank-width},
  journal   = DAM, 
  volume    = 157,
  number    = 4,
  year      = 2009,
  pages     = {627-640},
}

@article{Lampis12,
  author    = {Michael Lampis},
  title     = {Algorithmic Meta-theorems for Restrictions of Treewidth},
  journal   = Alg,
  volume    = {64},
  number    = {1},
  year      = {2012},
  pages     = {190--37},
}

@article{BuixuanHabibLimouzyDemontgolfier09,
 author = {Bui-Xuan, B. -M. and Habib, M. and Limouzy, V. and de
                  Montgolfier, F.},
 title = {Algorithmic aspects of a general modular decomposition theory},
 journal = DAM,
 volume = {157},
 number = {9},
 year = {2009},
 pages = {1993--2009},
} 




@inproceedings{AbukhzamFernau06,
  author    = {Faisal N. Abu-Khzam and
               Henning Fernau},
  title     = {Kernels: Annotated, Proper and Induced},
  booktitle = {Parameterized and Exact Computation, Second International
                  Workshop, IWPEC 2006, Z{\"u}rich, Switzerland, September
                  13-15, 2006},
  year      = {2006},
  pages   = {264--275},
  editor    = {Hans L. Bodlaender and Michael A. Langston},
 publisher = Springer,
 series = LNCS,
 }

@article{GanianHlineny10,
  author    = {Robert Ganian and
               Petr Hlin\v en{\'y}},
  title     = {On parse trees and {M}yhill-{N}erode-type tools for handling
               graphs of bounded rank-width},
  journal   = DAM,
  volume    = {158},
  number    = {7},
  year      = {2010},
  pages     = {851--867}
}

@article{HlinenyOum08,
  author    = {Petr Hlin\v en{\'y} and
               Sang-il Oum},
  title     = {Finding Branch-Decompositions and Rank-Decompositions},
  journal   = SiamJC,
  volume    = {38},
  number    = {3},
  year      = {2008},
  pages     = {1012--1032}
}

@article{CheinHabibMaurer81,
  author    = {M. Chein and M. Habib and M.C. Maurer},
  title     = {Partitive hypergraphs},
  journal   = DM,
  volume    = {37},
  number    = {1},
  pages     = {35--50},
  year      = {1981}
}

@inproceedings{CorneilHabibTedderPaul08,
  author    = {Marc Tedder and
               Derek G. Corneil and
               Michel Habib and
               Christophe Paul},
  title     = {Simpler Linear-Time Modular Decomposition Via Recursive
               Factorizing Permutations},
  booktitle = {Automata, Languages and Programming, 35th International
               Colloquium, ICALP 2008},
  year      = {2008},
  pages     = {634--645},
  publisher = Springer,
  series    = LNCS,
  volume    = {5125},
}



@article {ImpagliazzoPaturi01,
    author = {Impagliazzo, Russell and Paturi, Ramamohan},
     title = {On the complexity of {$k$}-{SAT}},
   journal = JCSS,
    volume = {62},
      year = {2001},
    number = {2},
     pages = {367--375},
}



@inproceedings{ChenKanj12,
  author    = {Jianer Chen and
               Iyad A. Kanj},
  title     = {Parameterized Complexity and Subexponential-Time Computability},
  pages     = {162--195},
  editor    = {Hans L. Bodlaender and
               Rod Downey and
               Fedor V. Fomin and
               D{\'a}niel Marx},
  booktitle     = {The Multivariate Algorithmic Revolution and Beyond - Essays
               Dedicated to Michael R. Fellows on the Occasion of His 60th
               Birthday},
  publisher = Springer,
  series    = LNCS,
  volume    = {7370},
  year      = {2012},
}


@article{JeavonsPetke12,
  author    = {Peter Jeavons and
               Justyna Petke},
  title     = {Local Consistency and SAT-Solvers},
  journal   = JAIR,
  volume    = {43},
  year      = {2012},
  pages     = {329--351},
}




@inproceedings{DimopoulosSterigou06,
  author    = {Yannis Dimopoulos and
               Kostas Stergiou},
  title     = {Propagation in {CSP} and {SAT}},
  pages     = {137--151},
  editor    = {Fr{\'e}d{\'e}ric Benhamou},
  booktitle     = {Principles and Practice of Constraint Programming - CP 2006,
               12th International Conference, CP 2006, Nantes, France,
               September 25-29, 2006, Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4204},
  year      = {2006},
}


@article{BenhamouParisSigel12,
  author    = {Belaid Benhamou and
               Lionel Paris and
               Pierre Siegel},
  title     = {Dealing with Satisfiability and n-ary CSPs in a Logical
               Framework},
  journal   = JAR,
  volume    = {48},
  number    = {3},
  year      = {2012},
  pages     = {391--417},
}


@article {Bennaceur04,
    author = {Bennaceur, Hachemi},
     title = {A comparison between {SAT} and {CSP} techniques},
   journal = Cons,
    volume = {9},
      year = {2004},
    number = {2},
     pages = {123--138},
}


@article {BeigelEppstein05,
  author       = {Beigel, Richard and Eppstein, David},
  title	       = {3-coloring in time {$\mathcal{O}(1.3289^n)$}},
  journal      = JAlg,
  volume       = {54},
  year	       = {2005},
  number       = {2},
  pages	       = {168--204},
}

@inproceedings{GrandoniItaliano06,
  author       = {Fabrizio Grandoni and Giuseppe F. Italiano},
  title	       = {Algorithms and Constraint Programming},
  pages	       = {2--14},
  editor       = {Fr{\'e}d{\'e}ric Benhamou},
  booktitle    = {Principles and Practice of Constraint Programming -
                  CP 2006, 12th International Conference, CP 2006,
                  Nantes, France, September 25-29, 2006, Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {4204},
  year	       = {2006},
}


@article {FederMotwani02,
  author       = {Feder, Tom{\'a}s and Motwani, Rajeev},
  title	       = {Worst-case time bounds for coloring and
                  satisfiability problems},
  journal      = JAlg,
  volume       = {45},
  year	       = {2002},
  number       = {2},
  pages	       = {192--201},
}

@inproceedings{Razgon05,
  author       = {Igor Razgon},
  title	       = {Complexity Analysis of Heuristic {CSP} Search
                  Algorithms},
  pages	       = {88-99},
  editor       = {Brahim Hnich and Mats Carlsson and Fran\c{c}ois
                  Fages and Francesca Rossi},
  booktitle    = {Recent Advances in Constraints, Joint ERCIM/CoLogNET
                  International Workshop on Constraint Solving and
                  Constraint Logic Programming, CSCLP 2005, Uppsala,
                  Sweden, June 20-22, 2005, Revised Selected and
                  Invited Papers},
  publisher    = Springer,
  series       = LNCS,
  volume       = {3978},
  year	       = {2006},
}

@inproceedings{BureshOppenheimMitchell06,
  author       = {Joshua Buresh-Oppenheim and David G. Mitchell},
  title	       = {Minimum Witnesses for Unsatisfiable {2CNF}s},
  booktitle    = {Proceedings of SAT 2006, Ninth International
                  Conference on Theory and Applications of
                  Satisfiability Testing, August 12-15, 2006, Seattle,
                  WA, USA},
  year	       = {2006},
  pages	       = {42-47},
  series       = LNCS,
  editor       = {Armin Biere and Carla P. Gomes},
  volume       = {4121},
}

@inproceedings{MoserEtal11,
  author       = {Hertli, Timon and Moser, Robin A. and Scheder,
                  Dominik},
  booktitle    = {Symposium on Theoretical Aspects of Computer
                  Science},
  editor       = {Schwentick, Thomas and D\"urr, Christoph},
  pages	       = {237-248},
  publisher    = LZI,
  title	       = {Improving {PPSZ} for {3-SAT} using Critical
                  Variables.},
  volume       = 9,
  year	       = 2011
}

@inproceedings{DuboisDequen01,
  author       = {Olivier Dubois and Gilles Dequen},
  title	       = {A backbone-search heuristic for efficient solving of
                  hard {3-SAT} formulae},
  year	       = {2001},
  pages	       = {248-253},
  editor       = {Bernhard Nebel},
  booktitle    = {Proceedings of the 17th International Joint
                  Conference on Artificial Intelligence, IJCAI 2001},
}

@inproceedings{SlaneyWalsh01,
  author       = {John K. Slaney and Toby Walsh},
  title	       = {Backbones in Optimization and Approximation},
  year	       = {2001},
  pages	       = {254-259},
  editor       = {Bernhard Nebel},
  booktitle    = {Proceedings of the 17th International Joint
                  Conference on Artificial Intelligence, IJCAI 2001},
}

@inproceedings{Parkes97,
  author       = {Parkes, Andrew J.},
  title	       = {Clustering at the phase transition},
  booktitle    = {14th National Conference on Artificial Intelligence},
  series       = {AAAI'97},
  year	       = {1997},
  location     = {Providence, Rhode Island},
  pages	       = {340--345},
  numpages     = {6},
  publisher    = {AAAI Press},
}

@article{SchneiderEtal96,
  author       = {Johannes Schneider and Christine Froschhammer and
                  Ingo Morgenstern and Thomas Husslein and Johannes
                  Maria Singer},
  title	       = {Searching for backbones -- an efficient parallel
                  algorithm for the traveling salesman problem},
  journal      = {Computer Physics Communications},
  year	       = {1996},
  volume       = {96},
  pages	       = {173-188}
}

@article{BelovMarquesSilva12,
  author       = {Anton Belov and Jo{\~a}o Marques-Silva},
  title	       = {{MUSer2}: An Efficient {MUS} Extractor},
  journal      = JSAT,
  volume       = {8},
  number       = {1/2},
  year	       = {2012},
  pages	       = {123-128},
}

@inproceedings{KautzSelman96,
  author       = {Kautz, Henry and Selman, Bart},
  title	       = {Pushing the envelope: planning, propositional logic,
                  and stochastic search},
  booktitle    = {Proceedings of the Thirteenth AAAI Conference on
                  Artificial Intelligence},
  series       = {AAAI'96},
  year	       = {1996},
  location     = {Portland, Oregon},
  pages	       = {1194--1201},
  numpages     = {8},
  publisher    = {AAAI Press},
}

@inproceedings{Strichman00,
  author       = {Shtrichman, Ofer},
  title	       = {Tuning SAT Checkers for Bounded Model Checking},
  booktitle    = {Computer Aided Verification: 12th International
                  Conference (CAV 2000)},
  year	       = {2000},
  pages	       = {480--494},
  numpages     = {15},
  publisher    = {Springer-Verlag},
  address      = {London, UK, UK},
}

@article{DownlingGallier84,
  author       = {William F. Dowling and Jean H. Gallier},
  title	       = {Linear-Time Algorithms for Testing the
                  Satisfiability of Propositional Horn Formulae},
  journal      = JLP,
  volume       = {1},
  number       = {3},
  year	       = {1984},
  pages	       = {267--284}
}

@inproceedings{GwynneKullmann13,
  author       = {Gwynne, Matthew and Kullmann, Oliver},
  booktitle    = {SOFSEM 2013: Theory and Practice of Computer
                  Science},
  series       = LNCS,
  volume       = {7741},
  pages	       = {220--232},
  title	       = {Generalising and Unifying SLUR and Unit-Refutation
                  Completeness.},
  year	       = 2013
}

@article{Kullmann99,
  author       = {Oliver Kullmann},
  title	       = {Investigating a general hierarchy of polynomially
                  decidable classes of CNF's based on short tree-like
                  resolution proofs},
  journal      = ECCC,
  number       = {41},
  volume       = {6},
  year	       = {1999},
}

@article{HabibPaul10,
  author       = {Michel Habib and Christophe Paul},
  title	       = {A survey of the algorithmic aspects of modular
                  decomposition},
  journal      = {Computer Science Review},
  volume       = {4},
  number       = {1},
  year	       = {2010},
  pages	       = {41--59}
}

@inproceedings{KaskiKoivistoNederlof12,
  Author       = {Petteri Kaski and Mikko Koivisto and Jesper
                  Nederlof},
  Booktitle    = {7th International Symposion on Parameterized and
                  Exact Computation (IPEC 2012) },
  Title	       = {Homomorphic Hashing for Sparse Coefficient
                  Extraction},
  Year	       = {2012},
}

@article{Courcelle03,
  title	       = {The monadic second-order logic of graphs {XIV}:
                  uniformly sparse graphs and edge set
                  quantifications},
  journal      = TCS,
  volume       = {299},
  number       = {1–3},
  pages	       = {1--36},
  year	       = {2003},
  author       = {Bruno Courcelle},
}

@article{GanianHlinenyObdrzalek13,
  author       = {Robert Ganian and Petr Hlinen{\'y} and Jan
                  Obdrz{\'a}lek},
  title	       = {Better Algorithms for Satisfiability Problems for
                  Formulas of Bounded Rank-width},
  journal      = FInf,
  volume       = {123},
  number       = {1},
  year	       = {2013},
  pages	       = {59-76}
}



@misc{KrokhinMarx12,
  author       = {Krokhin, Andrei and Marx, D{\'a}niel},
  title	       = {On the hardness of losing weight},
  journal      = TALG,
  volume       = {8},
  year	       = {2012},
  number       = {2},
  pages	       = {Art. 19, 18},
}



@inproceedings{RamanShankar13,
  author       = {Venkatesh Raman and Bal Sri Shankar},
  title	       = {Improved Fixed-Parameter Algorithm for the Minimum
                  Weight 3-SAT Problem},
  pages	       = {265--273},
  editor       = {Subir Kumar Ghosh and Takeshi Tokuyama},
  booktitle    = {WALCOM: Algorithms and Computation, 7th
                  International Workshop, WALCOM 2013, Kharagpur,
                  India, February 14-16, 2013. Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7748},
  year	       = {2013},
}


@inproceedings{GutinYeo12,
  author       = {Gregory Gutin and Anders Yeo},
  title	       = {Constraint Satisfaction Problems Parameterized above
                  or below Tight Bounds: A Survey},
  year	       = {2012},
  pages	       = {257--286},
  editor       = {Hans L. Bodlaender and Rod Downey and Fedor V. Fomin
                  and D{\'a}niel Marx},
  booktitle    = {The Multivariate Algorithmic Revolution and Beyond -
                  Essays Dedicated to Michael R. Fellows on the
                  Occasion of His 60th Birthday},
  publisher    = Springer,
  series       = LNCS,
  volume       = {7370},
}







% tree space

@article {AlekhnovichBensassonRazborovWigderson02,
    author = {Alekhnovich, Michael and Ben-Sasson, Eli and Razborov,
              Alexander A. and Wigderson, Avi},
     title = {Space complexity in propositional calculus},
   journal = SiamJC,
    volume = {31},
      year = {2002},
    number = {4},
     pages = {1184--1211},
}

@article {AtseriasDalmau08,
    author = {Atserias, Albert and Dalmau, V{\'{\i}}ctor},
     title = {A combinatorial characterization of resolution width},
   journal = JCSS,
    volume = {74},
      year = {2008},
    number = {3},
     pages = {323--334},
}


@article {Bensasson09,
    author = {Ben-Sasson, Eli},
     title = {Size-space tradeoffs for resolution},
   journal = SiamJC,
    volume = {38},
      year = {2009},
    number = {6},
     pages = {2511--2525},
   note = {Journal version of STOC'02 paper}
}

@article{BendavidGringauze98,
  author    = {Shai Ben-David and
               Anna Gringauze},
  title     = {On the Existence of Propositional Proof Systems and
                  Oracle-relativized Propositional Logic},
  journal   = ECCC,
  volume    = {5},
  number    = {21},
  year      = {1998},
}


@article{BensassonNordstrom10,
  author    = {Eli Ben-Sasson and
               Jakob Nordstr{\"o}m},
  title     = {Understanding Space in Proof Complexity: Separations and
               Trade-offs via Substitutions},
  journal   = ECCC,
  volume    = {17},
  year      = {2010},
  pages     = {125},
}


@article {ChenFlum10,
    author = {Chen, Yijia and Flum, J{\"o}rg},
     title = {On the complexity of {G}\"odel's proof predicate},
   journal = JSL,
    volume = {75},
      year = {2010},
    number = {1},
     pages = {239--254},
}
	


@incollection {DantchevRiis03,
    author = {Dantchev, Stefan and Riis, S{\o}ren},
     title = {On relativisation and complexity gap for resolution-based
              proof systems},
 booktitle = {Computer science logic},
    series = LNCS,
    volume = {2803},
     pages = {142--154},
 publisher = Springer,
      year = {2003},
}



@article {EstebanGalesiMessner04,
    author = {Esteban, Juan Luis and Galesi, Nicola and Messner, Jochen},
     title = {On the complexity of resolution with bounded conjunctions},
   journal = TCS,
    volume = {321},
      year = {2004},
    number = {2-3},
     pages = {347--370},
}


@article {EstebanToran01,
    author = {Esteban, Juan Luis and Tor{\'a}n, Jacobo},
     title = {Space bounds for resolution},
   journal = InfComp,
    volume = {171},
      year = {2001},
    number = {1},
     pages = {84--97},
}


@article {Krajicek59,
    author = {Kraj{\'{\i}}{\v{c}}ek, Jan},
     title = {Lower bounds to the size of constant-depth propositional
              proofs},
   journal = JSL,
    volume = {59},
      year = {1994},
    number = {1},
     pages = {73--86},
}


@book {Krajicek95,
    author = {Kraj{\'{\i}}{\v{c}}ek, Jan},
     title = {Bounded arithmetic, propositional logic, and complexity
              theory},
    series = {Encyclopedia of Mathematics and its Applications},
    volume = {60},
 publisher = {Cambridge University Press},
   address = {Cambridge},
      year = {1995},
}


@article {Krajicek01,
    author = {Kraj{\'{\i}}{\v{c}}ek, Jan},
     title = {On the weak pigeonhole principle},
      note = {Dedicated to the memory of Jerzy {\L}o{\'s}},
   journal = FMat,
    volume = {170},
      year = {2001},
    number = {1-2},
     pages = {123--140},
}



@article {Krajicek04,
    author = {Kraj{\'{\i}}{\v{c}}ek, Jan},
     title = {Combinatorics of first order structures and propositional
              proof systems},
   journal = AML,
    volume = {43},
      year = {2004},
    number = {4},
     pages = {427--441},
}

@article {KrajicekPudlak89,
    author = {Kraj{\'{\i}}{\v{c}}ek, Jan and Pudl{\'a}k, Pavel},
     title = {Propositional proof systems, the consistency of first order
              theories and the complexity of computations},
   journal = JSL,
    volume = {54},
      year = {1989},
    number = {3},
     pages = {1063--1079},
}



@incollection {KoblerMessner98,
    author = {K{\"o}bler, Johannes and Messner, Jochen},
     title = {Complete problems for promise classes by optimal proof systems
              for test sets},
 booktitle = {Thirteenth {A}nnual {IEEE} {C}onference on {C}omputational
              {C}omplexity ({B}uffalo, {NY}, 1998)},
     pages = {132--140},
 publisher = {IEEE Computer Soc., Los Alamitos, CA},
      year = {1998},
}


@article {MacielPitassiWoods02,
    author = {Maciel, Alexis and Pitassi, Toniann and Woods, Alan R.},
     title = {A new proof of the weak pigeonhole principle},
      note = {Special issue on STOC 2000 (Portland, OR)},
   journal = JCSS,
    volume = {64},
      year = {2002},
    number = {4},
     pages = {843--872},
}



@article {Nordstrom09,
    author = {Nordstr{\"o}m, Jakob},
     title = {Narrow proofs may be spacious: separating space and width in
              resolution},
   journal = SiamJC,
    volume = {39},
      year = {2009},
    number = {1},
     pages = {59--121},
}


@incollection {ParisWilkie83,
    author = {Paris, J. and Wilkie, A.},
     title = {Counting problems in bounded arithmetic},
 booktitle = {Methods in mathematical logic ({C}aracas, 1983)},
    series = {Lecture Notes in Math.},
    volume = {1130},
     pages = {317--340},
 publisher = Springer,
      year = {1985},
}


@article {Razborov03,
    author = {Razborov, Alexander},
     title = {Resolution lower bounds for the weak functional pigeonhole
              principle},
      note = {Logic and complexity in computer science (Cr{\'e}teil, 2001)},
   journal = TCS,
    volume = {303},
      year = {2003},
    number = {1},
     pages = {233--243},
}
	

@article {Riis01,
    author = {Riis, S{\o}ren},
     title = {A complexity gap for tree resolution},
   journal = ComCom,
    volume = {10},
      year = {2001},
    number = {3},
     pages = {179--209},
}



@article {RiisSitharam00,
    author = {Riis, S{\o}ren and Sitharam, Meera},
     title = {Generating hard tautologies using predicate logic and the
              symmetric group},
   journal = {Log. J. IGPL},
    volume = {8},
      year = {2000},
    number = {6},
     pages = {787--795},
}


@article {Segerlind07,
    author = {Segerlind, Nathan},
     title = {The complexity of propositional proofs},
   journal = BSL,
    volume = {13},
      year = {2007},
    number = {4},
     pages = {417--481},
}
	

@article {SegerlindBussImpagliazzo04,
    author = {Segerlind, Nathan and Buss, Sam and Impagliazzo, Russell},
     title = {A switching lemma for small restrictions and lower bounds for
              {$k$}-{DNF} resolution},
   journal = {SiamJC},
    volume = {33},
      year = {2004},
    number = {5},
     pages = {1171--1200},
}



@article {Stalmarck96,
    author = {St{\aa}lmarck, Gunnar},
     title = {Short resolution proofs for a sequence of tricky formulas},
   journal = ActaInf,
    volume = 33,
      year = 1996,
    number = 3,
     pages = {277--280},
}

 
@incollection {ChenFlum10a,
    author = {Chen, Yijia and Flum, J{\"o}rg},
     title = {On slicewise monotone parameterized problems and optimal proof
              systems for {TAUT}},
 booktitle = {Computer science logic},
    series = LNCS,
    volume = 6247,
     pages = {200--214},
 publisher = Springer,
      year = 2010,
}


@inproceedings{ChenFlumMuller12,
  author    = {Yijia Chen and
               J{\"o}rg Flum and
               Moritz M{\"u}ller},
  title     = {Hard Instances of Algorithms and Proof Systems},
  pages     = {118--128},
  editor    = {S. Barry Cooper and
               Anuj Dawar and
               Benedikt L{\"o}we},
  booktitle     = {How the World Computes - Turing Centenary Conference and
               8th Conference on Computability in Europe, CiE 2012, Cambridge,
               UK, June 18-23, 2012. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {7318},
  year      = {2012},
}


@article {JohnsonRobertsonSeymourThomas01,
    author = {Johnson, Thor and Robertson, Neil and Seymour, P. D. and
              Thomas, Robin},
     title = {Directed tree-width},
   journal = JCombTB,
    volume = {82},
      year = {2001},
    number = {1},
     pages = {138--154},
}




@InCollection{Mazala02,
  author       = {Ren\'{e} Mazala},
  title        = {Infinite games},
  booktitle    = {Automata, Logics, and Infinite Games},
  publisher =  Springer,
  year      = {2002},
  editor    = {E. Gr\"adel and W. Thomas},
  volume    = {2500},
  series    = LNCS,
  chapter   = {2},
}




@Article{Vardi10,
  author       = {Moshe Y. Vardi},
  title        = {On {P}, {NP}, and computational complexity},
  journal      = ComACM,
  year 	       = {2010},
  volume    = {53},
  number    = {11},
  pages     = {5},
  month     = NOV,
}

@inproceedings{BetzlerBredereckChenNiedermeier12,
  author    = {Nadja Betzler and
               Robert Bredereck and
               Jiehua Chen and
               Rolf Niedermeier},
  title     = {Studies in Computational Aspects of Voting - A Parameterized
               Complexity Perspective},
  pages     = {318--363},
  year      = {2012},
  editor    = {Hans L. Bodlaender and
               Rod Downey and
               Fedor V. Fomin and
               D{\'a}niel Marx},
  booktitle     = {The Multivariate Algorithmic Revolution and Beyond - Essays
               Dedicated to Michael R. Fellows on the Occasion of His 60th
               Birthday},
  publisher = Springer,
  series    = LNCS,
  volume    = {7370},
}



@inproceedings{LokshtanovMisraSaurabh12,
  author    = {Daniel Lokshtanov and
               Neeldhara Misra and
               Saket Saurabh},
  title     = {Kernelization - Preprocessing with a Guarantee},
  pages     = {129--161},
  editor    = {Hans L. Bodlaender and
               Rod Downey and
               Fedor V. Fomin and
               D{\'a}niel Marx},
  booktitle     = {The Multivariate Algorithmic Revolution and Beyond - Essays
               Dedicated to Michael R. Fellows on the Occasion of His 60th
               Birthday},
  publisher = Springer,
  series    = LNCS,
  volume    = {7370},
  year      = {2012},
}


@Book{BeckmannJohannsen04,
  author       = {Arnold Beckmann and Jan Johannsen},
  title        = {Bounded Arithmetic and Resolution-Based Proof Systems},
  publisher    = {Kurt G\"{o}del Society},
  year 	       = {2004},
  volume    = {7},
  series    = {Collegium Logicum},
}


@inproceedings{BessiereCarbonnelHebrardKatsirelosWalsh13,
  author    = {Christian Bessiere and
               Cl{\'e}ment Carbonnel and
               Emmanuel Hebrard and
               George Katsirelos and
               Toby Walsh},
  title     = {Detecting and Exploiting Subproblem Tractability},
  editor    = {Francesca Rossi},
  booktitle     = {IJCAI 2013, Proceedings of the 23rd International Joint
               Conference on Artificial Intelligence, Beijing, China, August
               3-9, 2013},
  publisher = {IJCAI/AAAI},
  year      = {2013},
}



@inproceedings{DilkinaGomesSabharwal09,
  author    = {Bistra N. Dilkina and
               Carla P. Gomes and
               Ashish Sabharwal},
  title     = {Backdoors in the Context of Learning},
  pages     = {73--79},
  editor    = {Oliver Kullmann},
  booktitle     = {Theory and Applications of Satisfiability Testing - SAT
               2009, 12th International Conference, SAT 2009, Swansea,
               UK, June 30 - July 3, 2009. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {5584},
  year      = {2009},
}



@inproceedings{GaspersSzeider13,
  author    = {Serge Gaspers and
               Stefan Szeider},
  title     = {Strong Backdoors to Bounded Treewidth SAT},
  pages     = {489--498},
  booktitle     = {54th Annual IEEE Symposium on Foundations of Computer Science,
               FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA},
  publisher = {IEEE Computer Society},
  year      = {2013},
}



# ERC 



@article {EiterGottlob92,
    author = {Eiter, Thomas and Gottlob, Georg},
     title = {On the complexity of propositional knowledge base revision,
              updates, and counterfactuals},
   journal = AI,
    volume = {57},
      year = {1992},
    number = {2-3},
     pages = {227--270},
}


@incollection {Nebel98,
    author = {Nebel, Bernhard},
     title = {How hard is it to revise a belief base?},
 booktitle = {Belief change},
    series = {Handb. Defeasible Reason. Uncertain. Manag. Syst.},
    volume = {3},
     pages = {77--145},
 publisher = {Kluwer Acad. Publ.},
   address = {Dordrecht},
      year = {1998},
}

@article {CadoliLenzerini94,
    author = {Cadoli, Marco and Lenzerini, Maurizio},
     title = {The complexity of propositional closed world reasoning and
              circumscription},
   journal = JCSS,
    volume = {48},
      year = {1994},
    number = {2},
     pages = {255--310},
}


@InProceedings{Reiter78,
  author       = {R. Reiter},
  title	       = {On Closed-World Databases},
  booktitle    = {Logic and Data Bases },
  pages	       = {55--76},
  year	       = 1978,
  editor       = {H. Gallaire and J. Minker},
  publisher    = {Plenum, New York},
}


@article{KnorrAlferesHitzler11,
  author    = {Matthias Knorr and
               Jos{\'e} J{\'u}lio Alferes and
               Pascal Hitzler},
  title     = {Local closed world reasoning with description logics under
               the well-founded semantics},
  journal   = AI,
  volume    = {175},
  number    = {9-10},
  year      = {2011},
  pages     = {1528--1554},
}


@inproceedings{LacknerPfandler12,
  author    = {Martin Lackner and
               Andreas Pfandler},
  title     = {Fixed-Parameter Algorithms for Closed World Reasoning},
  pages     = {492--497},
  editor    = {Luc De Raedt and
               Christian Bessi{\`e}re and
               Didier Dubois and
               Patrick Doherty and
               Paolo Frasconi and
               Fredrik Heintz and
               Peter J. F. Lucas},
  booktitle     = {ECAI 2012 - 20th European Conference on Artificial Intelligence.
               Including Prestigious Applications of Artificial Intelligence
               (PAIS-2012) System Demonstrations Track, Montpellier, France,
               August 27-31 , 2012},
  publisher = {IOS Press},
  series    = {Frontiers in Artificial Intelligence and Applications},
  volume    = {242},
  year      = {2012},
}

@article {GottlobPichlerWei10,
    author = {Gottlob, Georg and Pichler, Reinhard and Wei, Fang},
     title = {Bounded treewidth as a key to tractability of knowledge
              representation and reasoning},
   journal = {AI},
    volume = {174},
      year = {2010},
    number = {1},
     pages = {105--132},
}
	

@inproceedings{ChevaleyreEndrissLangMaudet07,
  author    = {Yann Chevaleyre and
               Ulle Endriss and
               J{\'e}r{\^o}me Lang and
               Nicolas Maudet},
  title     = {A Short Introduction to Computational Social Choice},
  pages     = {51--69},
  editor    = {Jan van Leeuwen and
               Giuseppe F. Italiano and
               Wiebe van der Hoek and
               Christoph Meinel and
               Harald Sack and
               Frantisek Plasil},
  booktitle     = {SOFSEM 2007: Theory and Practice of Computer Science, 33rd
               Conference on Current Trends in Theory and Practice of Computer
               Science, Harrachov, Czech Republic, January 20-26, 2007,
               Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {4362},
  year      = {2007},
}




@inproceedings{JamrogaSlavovik13,
  author    = {Wojciech Jamroga and
               Marija Slavkovik},
  title     = {Some Complexity Results for Distance-Based Judgment Aggregation},
  pages     = {313--325},
  editor    = {Stephen Cranefield and
               Abhaya C. Nayak},
  booktitle     = {AI 2013: Advances in Artificial Intelligence - 26th Australasian
               Joint Conference, Dunedin, New Zealand, December 1-6, 2013.
               Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {8272},
  year      = {2013},
}


@article {HemaspaandraSpakowskiVogel05,
    author = {Hemaspaandra, Edith and Spakowski, Holger and Vogel, J{\"o}rg},
     title = {The complexity of {K}emeny elections},
   journal = TCS,
    volume = {349},
      year = {2005},
    number = {3},
     pages = {382--391},
}
	

@article{HemaspaandraHemaspaandraRothe14,
  title	       = {The complexity of online manipulation of sequential
                  elections},
  author       ={Edith Hemaspaandra and Lane A. Hemaspaandra and J\"{o}rg Rothe},
  journal      = JCSS,
  volume       = {80},
  number       = {4},
  pages	       = {697--710},
  year	       = {2014},
}


@article {EndrissGrandiPorello12,
    author = {Endriss, Ulle and Grandi, Umberto and Porello, Daniele},
     title = {Complexity of judgment aggregation},
   journal = JAIR,
    volume = {45},
      year = {2012},
     pages = {481--514},
}


@article {GottlobGrecoScarcello05b,
    author = {Gottlob, Georg and Greco, Gianluigi and Scarcello, Francesco},
     title = {Pure {N}ash equilibria: hard and easy games},
   journal = JAIR,
    volume = {24},
      year = {2005},
     pages = {357--406},
}

@article {ScottStege10,
    author = {Scott, Allan and Stege, Ulrike},
     title = {Parameterized pursuit-evasion games},
   journal = TCS,
    volume = {411},
      year = {2010},
    number = {43},
     pages = {3845--3858},
}


@article {GoldsteinReingold95,
    author = {Goldstein, Arthur S. and Reingold, Edward M.},
     title = {The complexity of pursuit on a graph},
   journal = TCS,
    volume = {143},
      year = {1995},
    number = {1},
     pages = {93--112},
}

@book{Sipser97,
  author    = {Michael Sipser},
  title     = {Introduction to the theory of computation},
  publisher = {PWS Publishing Company},
  year      = {1997},
}



@article{MalikZhang09,
  author    = {Sharad Malik and
               Lintao Zhang},
  title     = {Boolean satisfiability from theoretical hardness to practical
               success},
  journal   = ComACM,
  volume    = {52},
  number    = {8},
  year      = {2009},
  pages     = {76--82},
}

@article{SakallahMarquessilva11,
  author    = {Karem A. Sakallah and
               Jo{\~a}o Marques-Silva},
  title     = {Anatomy and Empirical Evaluation of Modern {SAT} Solvers},
  journal   = BEATCS,
  volume    = {103},
  year      = {2011},
  pages     = {96--121},
}


@inproceedings{BiereCimattiClarkeZhu99,
  author       = {Armin Biere and Alessandro Cimatti and Edmund
                  M. Clarke and Yunshan Zhu},
  title	       = {Symbolic Model Checking without {BDD}s},
  pages	       = {193--207},
  editor       = {Rance Cleaveland},
  booktitle    = {Tools and Algorithms for Construction and Analysis
                  of Systems, 5th International Conference, TACAS '99,
%                  Held as Part of the European Joint Conferences on
%                  the Theory and Practice of Software, ETAPS'99,
                  Amsterdam, The Netherlands, March 22-28, 1999,
                  Proceedings},
  publisher    = Springer,
  series       = LNCS,
  volume       = {1579},
  year	       = {1999},
}

@article {FlumGrohe03,
    author = {Flum, J{\"o}rg and Grohe, Martin},
     title = {Describing parameterized complexity classes},
   journal = InfComp,
    volume = {187},
      year = {2003},
    number = {2},
     pages = {291--319},
}

@inproceedings{MeyerStockmeyer72,
  author    = {Albert R. Meyer and
               Larry J. Stockmeyer},
  title     = {The Equivalence Problem for Regular Expressions with Squaring
               Requires Exponential Space},
  booktitle = {SWAT},
  year      = {1972},
  pages     = {125-129},
  publisher = IEEE,
}

@article{Wrathall76,
  author    = {Celia Wrathall},
  title     = {Complete Sets and the Polynomial-Time Hierarchy},
  journal   = TCS,
  volume    = {3},
  number    = {1},
  year      = {1976},
  pages     = {23-33},
}

@book{HopcroftMotwaniUllman01,
  author    = {John E. Hopcroft and
               Rajeev Motwani and
               Jeffrey D. Ullman},
  title     = {Introduction to Automata Theory, Languages, and Computation},
  edition    = {Second},
  publisher = {Addison-Wesley-Longman},
  series    = {Addison-Wesley Series in Computer Science},
  year      = {2001},
  isbn      = {978-0-201-44124-6},
  pages     = {I-XIV, 1-521},
}

@article{Gottlob12,
  author    = {Georg Gottlob},
  title     = {On minimal constraint networks},
  journal   = AI,
  volume    = {191-192},
  year      = {2012},
  pages     = {42-60},
  ee        = {http://dx.doi.org/10.1016/j.artint.2012.07.006},
}

@inproceedings{ChenMarx13,
  author    = {Hubie Chen and
               D{\'a}niel Marx},
  title     = {Block-Sorted Quantified Conjunctive Queries},
  booktitle = {ICALP (2)},
  year      = {2013},
  pages     = {125-136},
  editor    = {Fedor V. Fomin and
               Rusins Freivalds and
               Marta Z. Kwiatkowska and
               David Peleg},
  publisher = Springer,
  series    = LNCS,
  volume    = {7966},
  year      = {2013}
}

@incollection{Gelfond07,
  author = {Gelfond, Michael},
  title = {Answer Sets},
  editor = {van Harmelen, Frank and Lifschitz, Vladimir and Porter, Bruce},
  publisher = {Elsevier Science},
  booktitle = {Handbook of Knowledge Representation},
  year = {2007},
}

@inproceedings{GebserKaufmannNeumannSchaub07,
    author = {Martin Gebser and Benjamin Kaufmann and Andr Neumann and Torsten Schaub},
    title = {Conflict-driven answer set solving},
    booktitle = {Proceedings of the 20th International Joint Conference on 
                  Artificial Intelligence, IJCAI 2007},
    year = {2007},
    pages = {386--392},
    publisher = {MIT Press},
}

@article{GiunchigliaLierlerMaratea06,
    author = {Enrico Giunchiglia and Yuliya Lierler and Marco Maratea},
    title = {Answer set programming based on propositional satisfiability},
    journal = JAR,
    year = {2006},
    volume = {36},
    pages = {345--377}
}

@article{Fages94,
  author = {Fages, Fran\c{c}ois},
  journal = {Methods of Logic in Computer Science},
  number = 1,
  pages = {51-60},
  title = {Consistency of {C}lark's completion and existence of stable models.},
  volume = 1,
  year = 1994
}

@article{JanhunenNiemelaSeipelSimonsYou06,
  author    = {Tomi Janhunen and
               Ilkka Niemel{\"a} and
               Dietmar Seipel and
               Patrik Simons and
               Jia-Huai You},
  title     = {Unfolding partiality and disjunctions in stable model semantics},
  journal   = ACMTCL,
  volume    = {7},
  number    = {1},
  year      = {2006},
  pages     = {1-37},
}

@inproceedings{LeeLifschitz03,
  author    = {Joohyung Lee and
               Vladimir Lifschitz},
  title     = {Loop Formulas for Disjunctive Logic Programs},
  booktitle = {Logic Programming, 19th International Conference, ICLP 2003,
               Mumbai, India, December 9-13, 2003, Proceedings},
  year      = {2003},
  pages     = {451-465},
  publisher = Springer,
  series = LNCS,
  volume = {2916},
  editor = {Catuscia Palamidessi},
}

@article{LifschitzRazborov06,
  author = {Lifschitz, Vladimir and Razborov, Alexander},
  title = {Why Are There So Many Loop Formulas?},
  journal = ACMTCL,
  volume = {7},
  number = {2},
  month = apr,
  year = {2006},
  pages = {261--268},
  numpages = {8},
  acmid = {1131316},
  publisher = {ACM},
  address = {New York, NY, USA},
}

@article{SchaeferUmans02,
   author = {Schaefer, Marcus and Umans, Christopher}, 
   journal = SigactNews, 
   month = sep, 
   number = {3}, 
   pages = {32-49}, 
   publisher = {ACM Press}, 
   title = {Completeness in the Polynomial-Time hierarchy: A Compendium}, 
   volume = {33}, 
   year = {2002}, 
}

@article{SanthanamWilliams13,
  author    = {Rahul Santhanam and
               Ryan Williams},
  title     = {New Algorithms for {QBF} Satisfiability and Implications for
               Circuit Complexity},
  journal   = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume    = {20},
  year      = {2013},
  pages     = {108},
}

@inproceedings{AtseriasOliva13,
  author    = {Albert Atserias and
               Sergi Oliva},
  editor    = {Natacha Portier and
               Thomas Wilke},
  title     = {Bounded-width {QBF} is {PSPACE}-complete},
  booktitle = {30th International Symposium on Theoretical Aspects of Computer
               Science, STACS 2013, February 27 - March 2, 2013, Kiel,
               Germany},
  year      = {2013},
  pages     = {44-54},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  series    = {LIPIcs},
  volume    = {20},
}

@book{NesetrilOssonademendez12,
  author    = {Jaroslav Nesetril and
               Patrice Ossona de Mendez},
  title     = {Sparsity - Graphs, Structures, and Algorithms},
  publisher = {Springer},
  series    = {Algorithms and Combinatorics},
  volume    = {28},
  year      = {2012}
}

@article{FlumGrohe01,
  author    = {J{\"o}rg Flum and
               Martin Grohe},
  title     = {Fixed-Parameter Tractability, Definability, and Model-Checking},
  journal   = {SIAM J. Comput.},
  volume    = {31},
  number    = {1},
  year      = {2001},
  pages     = {113-145}
}
  
@book{GrahamGrotschelLovasz95,
 editor = {Graham, R. L. and Gr\"{o}tschel, M. and Lov\'{a}sz, L.},
 title = {Handbook of Combinatorics (Vol. 1)},
 year = {1995},
 publisher = {MIT Press}
} 

@article{AlonYusterZwick95,
  author    = {Noga Alon and
               Raphael Yuster and
               Uri Zwick},
  title     = {Color-Coding},
  journal   = {JACM},
  volume    = {42},
  number    = {4},
  year      = {1995},
  pages     = {844-856}
}

@book{CourcelleEngelfriet12,
  author    = {Bruno Courcelle and
               Joost Engelfriet},
  title     = {Graph Structure and Monadic Second-Order Logic - A Language-Theoretic
               Approach},
  publisher = CamUP,
  series    = {Encyclopedia of mathematics and its applications},
  volume    = {138},
  year      = {2012}
}

@inproceedings{Vardi95,
  author    = {Moshe Y. Vardi},
  title     = {On the Complexity of Bounded-Variable Queries},
  booktitle = {Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium
               on Principles of Database Systems, May 22-25, 1995, San
               Jose, California, USA},
  year      = {1995},
  pages     = {266-276},
  publisher = {ACM Press},
  editor    = {Mihalis Yannakakis}
}

@article{Seese96,
  author    = {Detlef Seese},
  title     = {Linear Time Computable Problems and First-Order Descriptions},
  journal   = {Mathematical Structures in Computer Science},
  volume    = {6},
  number    = {6},
  year      = {1996},
  pages     = {505-526}
}

@inproceedings{GroheKreutzerSiebertz13,
  author    = {Martin Grohe and
               Stephan Kreutzer and
               Sebastian Siebertz},
  title     = {Characterisations of Nowhere Dense Graphs (Invited Talk)},
  booktitle = {IARCS Annual Conference on Foundations of Software Technology
               and Theoretical Computer Science, FSTTCS 2013, December
               12-14, 2013, Guwahati, India},
  year      = {2013},
  pages     = {21-40},
  series    = {LIPIcs},
  volume    = {24},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  editor    = {Anil Seth and Nisheeth K. Vishno}
}

@book{NielsonNielsonHankin05,
  author    = {Flemming Nielson and
               Hanne Riis Nielson and
               Chris Hankin},
  title     = {Principles of program analysis (2. corr. print)},
  publisher = {Springer},
  year      = {2005}
}

@book{RauschReinert10,
  author    = {Tobias Rausch and Knut Reinert},
  title     = {Problem Solving Handbook in Computational Biology and Bioinformatics},
  publisher = {Springer},
  year      = {2010}
}

@book{BorgerGradelGurevich97,
  author    = {Egon B{\"o}rger and
               Erich Gr{\"a}del and
               Yuri Gurevich},
  title     = {The Classical Decision Problem},
  publisher = {Springer},
  series    = {Perspectives in Mathematical Logic},
  year      = {1997}
}

@InProceedings{GroheKreutzer11,
  author	= {Martin Grohe and Stephan Kreutzer},
  title		= {Methods for Algorithmic Meta Theorems},
  booktitle	= {Model Theoretic Methods in Finite Combinatorics: AMS-ASL
		  Special Session, January 5-8, 2009},
  year		= 2011,
  series	= {Contemporary Mathematics},
  publisher	= {AMS},
  pages		= {181--206}
}

@book{CaspardLeclercMonjardet12,
  author = {Nathalie Caspard and Bruno Leclerc and Bernard Monjardet},
  publisher = CamUP,
  title = {Finite Ordered Sets -- Concepts, Results and Uses},
  year = 2012
}

@book{Schroder03,
  title={Ordered Sets: An Introduction},
  author={Schr{\"o}der, B.},
  year={2003},
  publisher={Birkh{\"a}user Boston}
}

@article{FelsnerRaghavanSpinrad03,
  author    = {Stefan Felsner and
               Vijay Raghavan and
               Jeremy Spinrad},
  title     = {Recognition Algorithms for Orders of Small Width and Graphs
               of Small Dilworth Number},
  journal   = {Order},
  volume    = {20},
  number    = {4},
  year      = {2003},
  pages     = {351-364}
}

@article{GorazdIdziak95,
  author    = {Tomasz A. Gorazd and Pawel M. Idziak},
  title     = {The isomorphism problem for varieties generated by a two-element algebra},
  journal   = {Algebra Universalis},
  volume    = {34},
  number    = {3},
  year      = {1995},
  pages     = {430-439}
}

@article{PrattTiuryn96,
  author    = {Vaughan R. Pratt and
               Jerzy Tiuryn},
  title     = {Satisfiability of Inequalities in a Poset},
  journal   = FInf,
  volume    = {28},
  number    = {1-2},
  year      = {1996},
  pages     = {165-182}
}

@article{FurediKahn86,
  author    = {Zolt\' an Furedi and Jeff Kahn},
  title     = {On the dimensions of ordered sets of bounded degree},
  journal   = {Order},
  volume    = {3},
  year      = {1986},
  pages     = {15-20}
}
 
@incollection{KleinebuningBubeck09,
   author = {Kleine B{\"u}ning, Hans and Bubeck, Uwe},
   title = {Theory of Quantified Boolean Formulas},
   chapter = {23},
   pages = {735--760},
Editor = {Biere, A. and Heule, M. J. H. and van Maaren, H. and Walsh, T.},
    booktitle = {Handbook of Satisfiability},
    Publisher = {IOS Press},
    Year = {2009},
    Volume = {185},
    Series = {Frontiers in Artificial Intelligence and Applications},
}

@inproceedings{Biere04,
  author    = {Armin Biere},
  title     = {Resolve and Expand},
  year      = {2004},
  booktitle = 	 {Proceedings of SAT 2004 (Seventh International
                  Conference on Theory and Applications of Satisfiability 
                  Testing, 10--13 May, 2004, Vancouver, BC, Canada)},
  pages = {59--70}
}

@inproceedings{AyariBasin02,
  author = {Ayari, Abdelwaheb and Basin, David A.},
  booktitle = {Proceedings of FMCAD 2002 (Formal Methods in
      Computer-Aided Design, 4th International Conference,
      November 6-8, 2002, Portland, OR, USA)},
  editor = {Aagaard, Mark and O'Leary, John W.},
  isbn = {3-540-00116-6},
  pages = {187-201},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {QUBOS: Deciding Quantified {B}oolean Logic Using Propositional Satisfiability Solvers.},
  volume = 2517,
  year = 2002
}

@article{GoldsmithHagenMundhenk08,
 author = {Goldsmith, Judy and Hagen, Matthias and Mundhenk, Martin},
 title = {Complexity of {DNF} Minimization and Isomorphism Testing for Monotone Formulas},
 journal = InfComp,
 volume = {206},
 number = {6},
 month = jun,
 year = {2008},
 issn = {0890-5401},
 pages = {760--775},
 numpages = {16},
 publisher = {Academic Press, Inc.},
 address = {Duluth, MN, USA},
} 

@book{ClarkeGrumbergPeled99,
 author = {Clarke, Edmund M. and Grumberg, Orna and Peled, Doron A.},
 title = {Model Checking},
 year = {1999},
 publisher = {MIT Press},
 address = {Cambridge, MA, USA},
}

@book{BaierKatoen2008,
 author = {Baier, Christel and Katoen, Joost-Pieter},
 title = {Principles of Model Checking},
 year = {2008},
 publisher = {The MIT Press},
} 

@inproceedings{ClarkeKroeningOuaknineStrichman04,
  author    = {Edmund M. Clarke and
               Daniel Kroening and
               Jo{\"e}l Ouaknine and
               Ofer Strichman},
  title     = {Completeness and Complexity of Bounded Model Checking},
  booktitle = {Verification, Model Checking, and Abstract Interpretation,
               5th International Conference, VMCAI 2004},
  editor    = {Bernhard Steffen and
               Giorgio Levi},
  year      = {2004},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2937},
  pages     = {85-96},
}

@PhdThesis{Oliva13,
  author = 	 {Sergi Oliva},
  title = 	 {On the Complexity of Resolution-based Proof Systems},
  school = 	 {Universitat Polit\`{e}cnica de Catalunya},
  year = 	 {2013},
  month = 	 Mar,
}

@inproceedings{MarquesSilvaJanotaBelov13,
  author    = {Joao Marques-Silva and
               Mikol{\'a}\v{s} Janota and
               Anton Belov},
  title     = {Minimal Sets over Monotone Predicates in {B}oolean Formulae},
  booktitle = {Computer Aided Verification: 25th International Conference, 
              CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings},
  year      = {2013},
  pages     = {592-607},
  editor    = {Natasha Sharygina and
               Helmut Veith},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {8044},
}

@inproceedings{Samer08,
  author    = {Marko Samer},
  title     = {Variable Dependencies of Quantified {CSP}s},
  pages     = {512-527},
  editor    = {Iliano Cervesato and
               Helmut Veith and
               Andrei Voronkov},
  booktitle  = {Logic for Programming, Artificial Intelligence, and Reasoning,
               15th International Conference, LPAR 2008, Doha, Qatar, November
               22-27, 2008. Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5330},
  year      = {2008}
}

@InProceedings{BiereLonsing10,
  author    = {Armin Biere and Florian Lonsing},
  title     = {Integrating Dependency Schemes in Search-Based {QBF} Solvers},
  booktitle = {Theory and Applications of Satisfiability Testing - SAT 2010},
  series    = {LNCS},
  editor    = {Strichman, Ofer and Szeider, Stefan},
  publisher = {Springer},
  pages     = {158-171},
  volume    = {6175},
  year      = {2010}
}

@InProceedings{BiereLonsing09,
  author    = {Arming Biere and Florian Lonsing},
  title     = {A Compact Representation for Syntactic Dependencies in {QBFs}},
  booktitle = {Theory and Applications of Satisfiability Testing - SAT 2009},
  series    = {LNCS},
  editor    = {Kullmann, Oliver},
  publisher = {Springer},
  pages     = {398-411},
  volume    = {5584},
  year      = {2009}
}

@phdthesis{Lonsing12,
  author    = {Florian Lonsing},
  title     = {Dependency Schemes and Search-Based {QBF} Solving: Theory and Practice},
  school    = {Johannes Kepler University, Linz, Austria},
  month     = Apr,
  year      = {2012}
}

@inproceedings{BalabanovJiang11,
  author    = {Valeriy Balabanov and
               Jie-Hong R. Jiang},
  title     = {Resolution Proofs and Skolem Functions in {QBF} Evaluation
               and Applications},
  booktitle = {Computer Aided Verification - 23rd International Conference,
               CAV 2011, Snowbird, UT, USA, July 14-20, 2011.},
  editor    = {Ganesh Gopalakrishnan and
               Shaz Qadeer},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {6806},
  year      = {2011},
  pages     = {149-164}
}

@inproceedings{BiereLonsingNiemetzPreinerSeidl12,
  author    = {Niemetz, Aina and Preiner, Mathias and Lonsing, Florian and Seidl, Martina and Biere, Armin},
  title     = {Resolution-Based Certificate Extraction for {QBF}},
  year      = {2012},
  booktitle = {Theory and Applications of Satisfiability Testing â SAT 2012},
  volume    = {7317},
  series    = {LNCS},
  editor    = {Cimatti, Alessandro and Sebastiani, Roberto},
  publisher = {Springer},
  pages     = {430-435}
}

@inproceedings{BalabanovChiangJiang12,
  author    = {Valeriy Balabanov and
               Hui-Ju Katherine Chiang and
               Jie-Hong Roland Jiang},
  title     = {Henkin Quantifiers and {B}oolean Formulae},
  booktitle = {Theory and Applications of Satisfiability Testing - SAT 2012},
editor    = {Alessandro Cimatti and Roberto Sebastiani},
 publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {7317},
  year      = {2012},
  pages     = {129-142},
}

@article{GiunchigliaNarizzanoTacchella06,
  author    = {Enrico Giunchiglia and
               Massimo Narizzano and
               Armando Tacchella},
  title     = {Clause/Term Resolution and Learning in the Evaluation of
               {Q}uantified {B}oolean {F}ormulas},
  journal   = JAIR,
  volume    = {26},
  year      = {2006},
  pages     = {371-416}
}

@article{CadoliSchaerfGiovanardiGiovanardi02,
  author    = {Marco Cadoli and
               Marco Schaerf and
               Andrea Giovanardi and
               Massimo Giovanardi},
  title     = {An Algorithm to Evaluate {Q}uantified {B}oolean {F}ormulae and
               Its Experimental Evaluation},
  journal   = JAR,
  volume    = {28},
  number    = {2},
  year      = {2002}
}

% To ensure proper capitalization and alphabetical sorting of "de Haan"/"De Haan",
% the command \DE is used.
% In the preamble of your document, use: \DeclareRobustCommand{\DE}[3]{#2}
% Right before the bibliography, use: \DeclareRobustCommand{\DE}[3]{#3}

@inproceedings{AjtaiKomlosSzemeredi83,
 author = {Ajtai, M. and Koml\'{o}s, J. and Szemer{\'e}di, E.},
 title = {An {O(N Log N)} Sorting Network},
 booktitle = {Proceedings of the 15th Annual ACM symposium on Theory of Computing (STOC'83)},
 year = {1983},
 pages = {1--9},
 numpages = {9},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@article{Paterson90,
  year={1990},
  journal=Alg,
  volume={5},
  number={1-4},
  title={Improved sorting networks with {O(log N)} depth},
  publisher={Springer-Verlag},
  author={Paterson, M.S.},
  pages={75-92},
}

@article{BelovLynceMarquesSilva12,
  author    = {Anton Belov and
               In{\^e}s Lynce and
               Jo{\~a}o Marques-Silva},
  title     = {Towards efficient {MUS} extraction},
  journal   = AIComm,
  volume    = {25},
  number    = {2},
  year      = {2012},
  pages     = {97-116},
}

@inproceedings{GregoireMazurePiette08,
  author = {Gr\'{e}goire, \'{E}ric and Mazure, Bertrand and Piette, C\'{e}dric},
  booktitle = {20th IEEE International Conference on Tools with Artificial
               Intelligence (ICTAI 2008), 3-5 November 2008, Daytion,
               Ohio, USA},
  pages = {74-83},
  publisher = {IEEE Computer Society},
  title = {On Approaches to Explaining Infeasibility of Sets of {B}oolean Clauses.},
  year = 2008
}

@article{DvorakJarvisaloWallnerWoltran14,
  title = {Complexity-sensitive decision procedures for abstract argumentation},
  author = {Wolfgang Dvo\v{r}\'{a}k and Matti J\"{a}rvisalo and Johannes Peter Wallner and Stefan Woltran},
  journal = AI,
  volume = {206},
  number = {0},
  pages = {53--78},
  year = {2014},
}


@article {FlumGroheWeyer06,
    author = {Flum, J{\"o}rg and Grohe, Martin and Weyer, Mark},
     title = {Bounded fixed-parameter tractability and {$\log^2n$}
              nondeterministic bits},
   journal = JCSS,
    volume = {72},
      year = {2006},
    number = {1},
     pages = {34--71},
}


@inproceedings{StockhusenTantau13,
  author    = {Christoph Stockhusen and
               Till Tantau},
  title     = {Completeness Results for Parameterized Space Classes},
  pages     = {335--347},
  editor    = {Gregory Gutin and
               Stefan Szeider},
  booktitle     = {Parameterized and Exact Computation - 8th International
               Symposium, IPEC 2013, Sophia Antipolis, France, September
               4-6, 2013, Revised Selected Papers},
  publisher = Springer,
  series    = LNCS,
  volume    = {8246},
  year      = {2013},
}


@inproceedings{Szeider13,
  author    = {Stefan Szeider},
 title     = {The Parameterized Complexity of Constraint Satisfaction
                  and Reasoning},
  pages     = {27--37},
  editor    = {Hans Tompits and
               Salvador Abreu and
               Johannes Oetsch and
               J{\"o}rg P{\"u}hrer and
               Dietmar Seipel and
               Masanobu Umeda and
               Armin Wolf},
  booktitle     = {Applications of Declarative Programming and
                  Knowledge Management - 19th International
                  Conference, INAP 2011, and 25th Workshop on Logic
                  Programming, WLP 2011, Vienna, Austria, September
                  28-30, 2011, Revised Selected Papers},
  publisher = Springer,
  series    = LNCS,
  volume    = {7773},
  year      = {2013},
}


@article {Hartmanis90,
    author = {Hartmanis, J.},
     title = {New developments in structural complexity theory},
   journal = TCS,
    volume = {71},
      year = {1990},
    number = {1},
     pages = {79--93},
}


@article {Wagner90,
    author = {Wagner, Klaus W.},
     title = {Bounded query classes},
   journal = SiamJC,
    volume = {19},
      year = {1990},
    number = {5},
     pages = {833--846},
}		


@inproceedings{WhittemoreKimSakallah01,
  author    = {Jesse Whittemore and
               Joonyoung Kim and
               Karem A. Sakallah},
  title     = {SATIRE: A New Incremental Satisfiability Engine},
  pages     = {542--545},
  booktitle     = {Proceedings of the 38th Design Automation Conference, DAC
               2001, Las Vegas, NV, USA, June 18-22, 2001},
  publisher = {ACM},
  year      = {2001},
}



@article {Hooker93,
    author = {Hooker, J. N.},
     title = {Solving the incremental satisfiability problem},
   journal = JLP,
    volume = {15},
      year = {1993},
    number = {1--2},
     PAGES = {177--186},
}



@inproceedings{BenedettiBernardini04,
  author    = {Marco Benedetti and
               Sara Bernardini},
  title     = {Incremental Compilation-to-SAT Procedures},
  pages     = {46--58},
  editor    = {Holger H. Hoos and
               David G. Mitchell},
  booktitle     = {Theory and Applications of Satisfiability Testing, 7th International
               Conference, SAT 2004, Vancouver, BC, Canada, May 10-13,
               2004, Revised Selected Papers},
  publisher = Springer,
  series    = LNCS,
  volume    = {3542},
  year      = {2005},
}



@inproceedings{Niedermeier10,
  author    = {Rolf Niedermeier},
  title     = {Reflections on Multivariate Algorithmics and Problem Parameterization},
  pages     = {17--32},
  editor    = {Jean-Yves Marion and
               Thomas Schwentick},
  booktitle     = {27th International Symposium on Theoretical Aspects of Computer
               Science, STACS 2010, March 4-6, 2010, Nancy, France},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  series    = {LIPIcs},
  volume    = {5},
  year      = {2010},
}




@inproceedings{Betzler10,
  author    = {Nadja Betzler},
  title     = {On Problem Kernels for Possible Winner Determination under
               the {\it k}-Approval Protocol},
  pages     = {114--125},
  editor    = {Petr Hlinen{\'y} and
               Anton\'{\i}n Kucera},
  booktitle     = {Mathematical Foundations of Computer Science 2010, 35th
               International Symposium, MFCS 2010, Brno, Czech Republic,
               August 23-27, 2010. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {6281},
  year      = {2010},
}


@article{FederKolaitis06,
  author = {Feder, Tom\'as and Kolaitis, Phokion G.},
  journal = ECCC,
  number = 160,
  title = {Closures and dichotomies for quantified constraints},
  volume = 13,
  year = 2006
}



@Article{Vardi14,
  author       = {Moshe Y. Vardi},
  title        = {Boolean satisfiability: theory and engineering},
  journal      = ComACM,
  year 	       = {2014},
  volume    = {57},
  number    = {3},
  pages     = {5},
  month     = MAR,
}



@article {LangMarquis10,
    author = {Lang, J{\'e}r{\^o}me and Marquis, Pierre},
     title = {Reasoning under inconsistency: a forgetting-based approach},
   journal = AI,
    volume = {174},
      year = {2010},
    number = {12-13},
     pages = {799--823},
}
	

@inproceedings{CostemarquisMarquis08,
  author    = {Sylvie Coste-Marquis and
               Pierre Marquis},
  title     = {Recovering Consistency by Forgetting Inconsistency},
  pages     = {113--125},
  editor    = {Steffen H{\"o}lldobler and
               Carsten Lutz and
               Heinrich Wansing},
  booktitle     = {Logics in Artificial Intelligence, 11th European Conference,
               JELIA 2008, Dresden, Germany, September 28 - October 1,
               2008. Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {5293},
  year      = {2008},
}



@article {DvorakWoltran11,
    author = {Dvo{\v{r}}{\'a}k, Wolfgang and Woltran, Stefan},
     title = {On the intertranslatability of argumentation semantics},
   journal = JAIR,
    volume = {41},
      year = {2011},
     pages = {445--475},
}
	



@Article{Bjoerk09,
  author       = {Magnus B\"{o}rk},
  title        = {Successful {SAT} Encoding Techniques},
  journal      = JSAT,
  year 	       = {2009},
    month     = JUL,
    note    = {Addendum Paper}
}



@inproceedings{Stuckey10,
  author    = {Peter J. Stuckey},
  title     = {Lazy Clause Generation: Combining the Power of {SAT} and {CP}
               (and {MIP}?) Solving},
  pages     = {5--9},
  editor    = {Andrea Lodi and
               Michela Milano and
               Paolo Toth},
  booktitle     = {Integration of AI and OR Techniques in Constraint Programming
               for Combinatorial Optimization Problems, 7th International
               Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010.
               Proceedings},
  publisher = Springer,
  series    = LNCS,
  volume    = {6140},
  year      = {2010},
}


@article {BussGoldsmith93,
    author = {Buss, Jonathan F. and Goldsmith, Judy},
     title = {Nondeterminism within {${\rm P}$}},
   journal = SiamJC,
    volume = {22},
      year = {1993},
    number = {3},
     pages = {560--572},
}


@inproceedings{FellowsPfandlerRosamondRummele12,
  author    = {Michael R. Fellows and
               Andreas Pfandler and
               Frances A. Rosamond and
               Stefan R{\"u}mmele},
  title     = {The Parameterized Complexity of Abduction},
  editor    = {J{\"o}rg Hoffmann and
               Bart Selman},
  booktitle     = {Proceedings of the Twenty-Sixth AAAI Conference on Artificial
               Intelligence, July 22-26, 2012, Toronto, Ontario, Canada},
  publisher = {AAAI Press},
  year      = {2012},
}

@inproceedings{Drucker12,
  author    = {Andrew Drucker},
  title     = {New Limits to Classical and Quantum Instance Compression},
  pages     = {609--618},
  booktitle     = {53rd Annual IEEE Symposium on Foundations of Computer Science,
               FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012},
  publisher = {IEEE Computer Society},
  year      = {2012},
}



@inproceedings{DeHaanSzeider14,
  author    = {{\DE{Haan}{De}{de}} Haan, Ronald and
               Stefan Szeider},
  title     = {The Parameterized Complexity of Reasoning Problems Beyond {NP}},
  editor    = {Chitta Baral and
                    Giuseppe {De Giacomo} and
                    Thomas Eiter},
  booktitle     = {Principles of Knowledge Representation and Reasoning: Proceedings
               of the Fourteenth International Conference, KR 2014,
               Vienna, Austria, July 20-24, 2014},
  publisher = {AAAI Press},
  year      = {2014}
}





@article {ChenGrohe10,
    author = {Chen, Hubie and Grohe, Martin},
     title = {Constraint satisfaction with succinctly specified relations},
   journal = JCSS,
    volume = {76},
      year = {2010},
    number = {8},
     pages = {847--860},
}



@article {DowneyFellows95b,
    author = {Downey, Rod G. and Fellows, Michael R.},
     title = {Fixed-parameter tractability and completeness. {I}. {B}asic
              results},
   JOURNAL = SiamJC,
    volume = {24},
      year = {1995},
    number = {4},
     pages = {873--921},
}
		



@inproceedings{CostemarquismMarquis05,
  author    = {Sylvie Coste-Marquis and
               Pierre Marquis},
  title     = {On the Complexity of Paraconsistent Inference Relations},
  pages     = {151--190},
  editor    = {Leopoldo E. Bertossi and
               Anthony Hunter and
               Torsten Schaub},
  booktitle     = {Inconsistency Tolerance},
  publisher = Springer,
  series    = LNCS,
  volume    = {3300},
  year      = {2005},
}


@inproceedings{BertossiHunterSchaub05,
  author    = {Leopoldo E. Bertossi and
               Anthony Hunter and
               Torsten Schaub},
  title     = {Introduction to Inconsistency Tolerance},
  pages     = {1--14},
  editor    = {Leopoldo E. Bertossi and
               Anthony Hunter and
               Torsten Schaub},
  booktitle = {Inconsistency Tolerance},
  publisher = Springer,
  series    = LNCS,
  volume    = {3300},
  year      = {2005},
}
\
@article{HobbsStickelAppeltMartin93,
  author    = {Jerry R. Hobbs and
               Mark E. Stickel and
               Douglas E. Appelt and
               Paul A. Martin},
  title     = {Interpretation as Abduction},
  journal   = AI,
  volume    = 63,
  number    = {1-2},
  year      = 1993,
  pages     = {69--142},
}


@article{StumptnerWotaba01,
  author    = {Markus Stumptner and
               Franz Wotawa},
  title     = {Diagnosing tree-structured systems},
  journal   = AI,
  volume    = {127},
  number    = {1},
  year      = {2001},
  pages     = {1--29},
}

@inproceedings{BylanderAllemangTannerJosephson89,
  author    = {Tom Bylander and
               Dean Allemang and
               Michael C. Tanner and
               John R. Josephson},
  title     = {Some Results Concerning the Computational Complexity of
               Abduction},
  pages     = {44--54},
  editor    = {Ronald J. Brachman and
               Hector J. Levesque and
               Raymond Reiter},
  booktitle     = {Proceedings of the 1st International Conference on Principles
               of Knowledge Representation and Reasoning (KR'89). Toronto,
               Canada, May 15-18 1989},
  publisher = {Morgan Kaufmann},
  year      = {1989},
}






@InProceedings{EndrissDeHaanSzeider14,
  author    = {Endriss, Ulle and {\DE{Haan}{De}{de}} Haan, Ronald and
               Stefan Szeider},
  title        = {The Parameterized Complexity of Agenda Safety in Judgment Aggregation},
  booktitle = {Proceedings of ComSoc'14, Fifth International Workshop
                  on Computational Social Choice Pittsburgh,
                  Pennsylvania, June 23-25, 2014},
  year      = {2014},
  note      = {To Appear},
}



@InProceedings{DeHaanSzeider14b,
  author    = {{\DE{Haan}{De}{de}} Haan, Ronald and
               Stefan Szeider},
  title        = {Fixed-Parameter Tractable Reductions to {SAT}},
  booktitle = {Proceedings of SAT 2014, the 17th International
                  Conference on Theory and Applications of
                  Satisfiability Testing July 14-17, 2014, Vienna,
                  Austria},
  editor    = {Uwe Egly and Carsten Sinz},
  series    = LNCS,
  publisher = Springer,
  year      = 2014,
  note      = {To Appear},
}

@article {Krentel88,
    author = {Krentel, Mark W.},
     title = {The complexity of optimization problems},
      note = {Structure in Complexity Theory Conference (Berkeley, CA,
              1986)},
   journal = JCSS,
    volume = {36},
      year = {1988},
    number = {3},
     pages = {490--509},
}

@article {ChangKadin96,
    author = {Chang, Richard and Kadin, Jim},
     title = {The {B}oolean hierarchy and the polynomial hierarchy: a closer
              connection},
   journal = SiamJC,
    volume = {25},
      year = {1996},
    number = {2},
     pages = {340--354},
}
	


@Misc{libtw13,
  key       = {libtw},
  title     = {{LibTW}---A software package for computing the
                  treewidth of graphs},
  howpublished = {\url{treewidth.com}},
  note      = {Utrecht University},
}

	

@article {DarwicheMarquis02,
    author = {Darwiche, Adnan and Marquis, Pierre},
     title = {A knowledge compilation map},
   journal = JAIR,
    volume = {17},
      year = {2002},
     pages = {229--264 (electronic)},
}
	

@article {Cai03,
    author = {Cai, Leizhen},
     title = {Parameterized complexity of vertex colouring},
   journal = DAM,
    volume = {127},
      year = {2003},
    number = {3},
     pages = {415--429},
}



@Misc{Asparagus09,
  key       = {Asparagus}, 
  title     = {Asparagus---a Web-based Benchmarking Environment for
                  Answer Set Programming},
  howpublished = {\url{asparagus.cs.uni-potsdam.de}},
  note      = {University of Potsdam},
}



@book {Immerman99,
    author = {Immerman, Neil},
     title = {Descriptive complexity},
    series = {Graduate Texts in Computer Science},
 publisher = Springer,
      year = {1999},
}
	


@incollection{Peppas08,
  author       = {Pavlos Peppas},
  title	       = {Belief Revsion},
  pages	       = {317--359},
  booktitle    = {Handbook of Knowledge Representation},
  editors      = {{van Harmelen}, Frank and Lifschitz, Vladimir and
                  Porter, Bruce},
  series       = {Foundations of Artificial Intelligence},
  volume       = {3},
  year	       = {2008},
  publisher    = {Elsevier},
}


@article {Davis06,
    author = {Davis, Martin},
     title = {Turing reducibility?},
   journal = NAMS,
    volume = {53},
      year = {2006},
    number = {10},
     pages = {1218--1219},
}


@phdthesis{Umans00,
  author = {Umans, Christopher},
  year = {2000},
  title = {Approximability and Completeness in the Polynomial Hierarchy},
  school = {University of California, Berkeley}
}



@book {DowneyFellows13,
    author = {Downey, Rodney G. and Fellows, Michael R.},
     title = {Fundamentals of parameterized complexity},
    series = {Texts in Computer Science},
 publisher = Springer,
      year = {2013},
}


@article {RishDechter00,
    author = {Rish, Irina and Dechter, Rina},
     title = {Resolution versus search: two strategies for {SAT}},
   journal = JAR,
    volume = {24},
      year = {2000},
    number = {1-2},
     pages = {225--275},
}


@inproceedings{Imanishi17,
  author    = {Kensuke Imanishi},
  title     = {An Upper Bound for Resolution Size: Characterization of Tractable
               {SAT} Instances},
  booktitle = {{WALCOM:} Algorithms and Computation, 11th International Conference
               and Workshops, {WALCOM} 2017, Hsinchu, Taiwan, March 29-31, 2017,
               Proceedings.},
  pages     = {359--369},
  year      = {2017},
  editor    = {Sheung{-}Hung Poon and
               Md. Saidur Rahman and
               Hsu{-}Chun Yen},
  series    = LNCS,
  volume    = {10167},
  publisher = Springer,
}

@article{NesetrilMendez06,
  author    = {Jaroslav Nesetril and
               Patrice Ossona de Mendez},
  title     = {Tree-depth, subgraph coloring and homomorphism bounds},
  journal   = {Eur. J. Comb.},
  volume    = {27},
  number    = {6},
  pages     = {1022--1041},
  year      = {2006},
}



@inproceedings{GutinJonesWahlstrom15,
  author    = {Gregory Z. Gutin and
               Mark Jones and
               Magnus Wahlstr{\"{o}}m},
  title     = {Structural Parameterizations of the Mixed Chinese Postman Problem},
  booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
               Greece, September 14-16, 2015, Proceedings},
  pages     = {668--679},
  year      = {2015},
  editor    = {Nikhil Bansal and
               Irene Finocchi},
  series    = {Lecture Notes in Computer Science},
  volume    = {9294},
  publisher = {Springer},
}

@inproceedings{IwataOgasawaraOhsaka18,
  author    = {Yoichi Iwata and
               Tomoaki Ogasawara and
               Naoto Ohsaka},
  title     = {On the Power of Tree-Depth for Fully Polynomial {FPT} Algorithms},
  booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
               2018, February 28 to March 3, 2018, Caen, France},
  pages     = {41:1--41:14},
  year      = {2018},
  editor    = {Rolf Niedermeier and
               Brigitte Vall{\'{e}}e},
  series    = {LIPIcs},
  volume    = {96},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
}

@article{KourteckyLevinOnn18,
  author    = {Martin Kouteck{\'{y}} and
               Asaf Levin and
               Shmuel Onn},
  title     = {A Parameterized Strongly Polynomial Algorithm for Block Structured
               Integer Programs},
  journal   = {CoRR},
  volume    = {abs/1802.05859},
  year      = {2018},
}

@inproceedings{GajarskyHlineny12,
  author    = {Jakub Gajarsk{\'{y}} and
               Petr Hlinen{\'{y}}},
  title     = {Faster Deciding {MSO} Properties of Trees of Fixed Height, and Some
               Consequences},
  booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
               Theoretical Computer Science, {FSTTCS} 2012, December 15-17, 2012,
               Hyderabad, India},
  pages     = {112--123},
  year      = {2012},
  editor    = {Deepak D'Souza and
               Telikepalli Kavitha and
               Jaikumar Radhakrishnan},
  series    = {LIPIcs},
  volume    = {18},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
}



@inproceedings{ReidlRossmanithVillaamilSikar14,
  author    = {Felix Reidl and
               Peter Rossmanith and
               Fernando S{\'{a}}nchez Villaamil and
               Somnath Sikdar},
  title     = {A Faster Parameterized Algorithm for Treedepth},
  booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
               {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
               {I}},
  pages     = {931--942},
  year      = {2014},
  editor    = {Javier Esparza and
               Pierre Fraigniaud and
               Thore Husfeldt and
               Elias Koutsoupias},
  series    = LNCS,
  volume    = {8572},
  publisher = Springer,
}

@article{FominGiannopoulouPilipczuk15,
  author    = {Fedor V. Fomin and
               Archontia C. Giannopoulou and
               Michal Pilipczuk},
  title     = {Computing Tree-Depth Faster Than 2\({}^{\mbox{n}}\)},
  journal   = Alg,
  volume    = {73},
  number    = {1},
  pages     = {202--216},
  year      = {2015},
}


@book{NesetrilMendez12,
  author    = {Jaroslav Ne{\v s}et{\v r}il and
               Patrice Ossona de Mendez},
  title     = {Sparsity - Graphs, Structures, and Algorithms},
  series    = {Algorithms and combinatorics},
  volume    = {28},
  publisher = {Springer},
  year      = {2012},
}






@inproceedings{BergJarvisalo14,
  author    = {Jeremias Berg and
               Matti J{\"{a}}rvisalo},
  title     = {SAT-Based Approaches to Treewidth Computation: An Evaluation},
  booktitle = {26th {IEEE} International Conference on Tools with
                  Artificial Intelligence, {ICTAI} 2014, Limassol,
                  Cyprus, November 10-12, 2014},
  pages     = {328--335},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
}


@inproceedings{BannachBerndtEhlers17,
  author    = {Max Bannach and
               Sebastian Berndt and
               Thorsten Ehlers},
  title     = {Jdrasil: {A} Modular Library for Computing Tree Decompositions},
  booktitle = {16th International Symposium on Experimental
                  Algorithms, {SEA} 2017, June 21-23, 2017, London,
                  {UK}},
  pages     = {28:1--28:21},
  year      = {2017},
  editor    = {Costas S. Iliopoulos and
               Solon P. Pissis and
               Simon J. Puglisi and
               Rajeev Raman},
  series    = {LIPIcs},
  volume    = {75},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
}





@article{LodhaOrdyniakSzeider19,
  author    = {Neha Lodha and
               Sebastian Ordyniak and
               Stefan Szeider},
  title     = {A {SAT} Approach to Branchwidth},
  journal   = ACMTCL,
  volume    = {20},
  number    = {3},
  pages     = {15:1--15:24},
  year      = {2019},
  doi       = {10.1145/3326159},
}


# treedepth refs from sanchez thesis #==================================

@phdthesis{villaamil2017treedepth,
  title={About Treedepth and Related Notions},
  author={Villaamil, Fernando S{\'a}nchez},
  year={2017},
  school={RWTH Aachen University}
}


@article{liu1990role,
  title={The role of elimination trees in sparse factorization},
  author={Liu, Joseph WH},
  journal={SIAM journal on matrix analysis and applications},
  volume={11},
  number={1},
  pages={134--172},
  year={1990},
  publisher={SIAM}
}

@article{llewellyn1989local,
  title={Local optimization on graphs.},
  author={Llewellyn, Donna Crystal and Tovey, Craig and Trick, Michael},
  journal={Discrete Applied Mathematics},
  volume={23},
  number={2},
  pages={157--178},
  year={1989}
}

@article{pothen88,
  title={The complexity of optimal elimination trees},
  author={Pothen, Alex},
  journal={Technical Report},
  year={1988}
}

@techreport{iyer1986node,
  title={On a node ranking problem of trees and graphs},
  author={Iyer, Ananth V and Ratliff, H Donald and Vijayan, Gopalakrishnan},
  year={1986},
  institution={Georgia Inst of Tech Atlanta Production and Distribution Research Center}
}

@phdthesis{kees1982organization,
  title={The organization of circuit analysis on array architectures},
  author={Kees, Hendrikus Gerardus Maria},
  year={1982},
  school={Citeseer}
}

@article{jesskeesa,
    title={A data structure for the parallel L/U decomposition},
    author={Jess, J. A. G. and Kees H. G. M.},
    journal={THE-afdeling Electrotechniek}
}

@article{jess1982data,
  title={A data structure for parallel L/U decomposition},
  author={Jess, Jochen A. G. and Kees, Hendrikus Gerardus Maria},
  journal={IEEE Transactions on Computers},
  number={3},
  pages={231--239},
  year={1982},
  publisher={IEEE}
}

@article{pieck1980formele,
  title={Formele definitie van een e-tree},
  author={Pieck, JTM},
  journal={Eindhoven University of Technology: Dept of Mathematics: memorandum},
  volume={8006},
  year={1980},
  publisher={Technische Hogeschool Eindhoven}
}


# BNs

@MISC{Chickering96,
    author = {David Maxwell Chickering},
    title = {Learning Equivalence Classes Of {B}ayesian Network Structures},
    year = {1996}
}


@inproceedings{KorhonenParviainen13,
  author    = {Janne H. Korhonen and
               Pekka Parviainen},
  title     = {Exact Learning of Bounded Tree-width {B}ayesian Networks},
  booktitle = {Proceedings of the Sixteenth International Conference
                  on Artificial Intelligence and Statistics, {AISTATS}
                  2013, Scottsdale, AZ, USA, April 29 - May 1, 2013},
  pages     = {370--378},
  series    = {{JMLR} Workshop and Conference Proceedings},
  volume    = {31},
  publisher = {JMLR.org},
  year      = {2013},
}



@inproceedings{ElidanGould08,
  author    = {Gal Elidan and
               Stephen Gould},
  title     = {Learning Bounded Treewidth {B}ayesian Networks},
  booktitle = {Advances in Neural Information Processing Systems 21,
                  Proceedings of the Twenty-Second Annual Conference
                  on Neural Information Processing Systems, Vancouver,
                  British Columbia, Canada, December 8-11, 2008},
  pages     = {417--424},
  editor    = {Daphne Koller and
               Dale Schuurmans and
               Yoshua Bengio and
               L{\'{e}}on Bottou},
  publisher = {Curran Associates, Inc.},
  year      = {2009},
}


@inproceedings{NieCamposJi15,
  author    = {Siqi Nie and
               Cassio Polpo de Campos and
               Qiang Ji},
  title     = {Learning Bounded Tree-Width {B}ayesian Networks via Sampling},
  booktitle = {Symbolic and Quantitative Approaches to Reasoning with
                  Uncertainty - 13th European Conference, {ECSQARU}
                  2015, Compi{\`{e}}gne, France, July 15-17,
                  2015. Proceedings},
  pages     = {387--396},
  editor    = {S{\'{e}}bastien Destercke and
               Thierry Denoeux},
  series    = LNCS,
  volume    = {9161},
  publisher = Springer,
  year      = {2015},
}


@inproceedings{ScanagattaCoraniCamposZaffalon16,
  author    = {Mauro Scanagatta and
               Giorgio Corani and
               Cassio Polpo de Campos and
               Marco Zaffalon},
  title     = {Learning Treewidth-Bounded {B}ayesian Networks with
                  Thousands of Variables},
  booktitle = {Advances in Neural Information Processing Systems 29:
                  Annual Conference on Neural Information Processing
                  Systems 2016, December 5-10, 2016, Barcelona, Spain},
  pages     = {1462--1470},
  editor    = {Daniel D. Lee and Masashi Sugiyama and Ulrike von
                  Luxburg and Isabelle Guyon and Roman Garnett},
  year      = {2016},
}



@inproceedings{ParviainenFarahaniLagergren14,
  author    = {Pekka Parviainen and
               Hossein Shahrabi Farahani and
               Jens Lagergren},
  title     = {Learning Bounded Tree-width {B}ayesian Networks using
                  {I}nteger {L}inear {P}rogramming},
  booktitle = {Proceedings of the Seventeenth International Conference
                  on Artificial Intelligence and Statistics, {AISTATS}
                  2014, Reykjavik, Iceland, April 22-25, 2014},
  pages     = {751--759},
  series    = {{JMLR} Workshop and Conference Proceedings},
  volume    = {33},
  publisher = {JMLR.org},
  year      = {2014},
}

@inproceedings{BergJarvisaloMalone14,
  author    = {Jeremias Berg and
               Matti J{\"{a}}rvisalo and
               Brandon M. Malone},
  title     = {Learning Optimal Bounded Treewidth {B}ayesian Networks
                  via Maximum Satisfiability},
  booktitle = {Proceedings of the Seventeenth International Conference
                  on Artificial Intelligence and Statistics, {AISTATS}
                  2014, Reykjavik, Iceland, April 22-25, 2014},
  pages     = {86--95},
  series    = {{JMLR} Workshop and Conference Proceedings},
  volume    = {33},
  publisher = {JMLR.org},
  year      = {2014},
}


@article{ParviainenKoivisto10,
  author    = {Pekka Parviainen and
               Mikko Koivisto},
  title     = {{B}ayesian structure discovery in {B}ayesian networks with less
               space},
  journal   = {Journal of Machine Learning Research - Proceedings Track},
  volume    = {9},
  year      = {2010},
  pages     = {589--596}
}
@incollection {Chickering95,
    author = {Chickering, David Maxwell},
     title = {Learning {B}ayesian networks is {NP}-complete},
 booktitle = {Learning from data ({F}ort {L}auderdale, {FL}, 1995)},
    series = {Lecture Notes in Statist.},
    volume = {112},
     pages = {121--130},
 publisher = Springer,
      year = {1996},
}


@article{BodlaenderMoehring93,
	Author = {Bodlaender, Hans L. and M{\"{o}}hring, Rolf H.},
	Journal = SiamJDM,
	Number = {2},
	Pages = {181--188},
	Title = {The Pathwidth and Treewidth of Cographs},
	Volume = {6},
	Year = {1993},
   doi = {10.1137/0406014},
	}




@article{ScanagattaCZYK18,
  author    = {Mauro Scanagatta and Giorgio Corani and Marco Zaffalon
                  and Jaemin Yoo and U Kang},
  title     = {Efficient learning of bounded-treewidth {B}ayesian
                  networks from complete and incomplete data sets},
  journal   = IJAR,
  volume    = {95},
  pages     = {152--166},
  year      = {2018},
}



@inproceedings{BergJarvisaloMMalone14,
  author    = {Jeremias Berg and Matti J{\"{a}}rvisalo and Brandon
                  M. Malone},
  title     = {Learning Optimal Bounded Treewidth {B}ayesian Networks
                  via Maximum Satisfiability},
  booktitle = {Proceedings of the Seventeenth International Conference
                  on Artificial Intelligence and Statistics, {AISTATS}
                  2014, Reykjavik, Iceland, April 22-25, 2014},
  pages     = {86--95},
  year      = {2014},
  series    = {{JMLR} Workshop and Conference Proceedings},
  volume    = {33},
  publisher = {JMLR.org},
}

@inproceedings{NieCamposJi16,
  author    = {Siqi Nie and Cassio Polpo de Campos and Qiang Ji},
  title     = {Learning {B}ayesian Networks with Bounded Tree-width via
                  Guided Search},
  booktitle = {Proceedings of the Thirtieth {AAAI} Conference on
                  Artificial Intelligence, February 12-17, 2016,
                  Phoenix, Arizona, {USA}},
  pages     = {3294--3300},
  editor    = {Dale Schuurmans and Michael P. Wellman},
  publisher = {{AAAI} Press},
  year      = {2016},
}

@book{KollerFriedman09,
	title={Probabilistic {G}raphical {M}odels: principles and techniques},
	author={Koller, Daphne and Friedman, Nir},
	year={2009},
	publisher={MIT press}
}


@inproceedings{LowdJesse10,
  title={Learning Markov network structure with decision trees},
  author={Lowd, Daniel and Davis, Jesse},
  booktitle={2010 IEEE International Conference on Data Mining},
  pages={334--343},
  year={2010},
  organization={IEEE}
}

@inproceedings{VanDavis12,
  title={Markov network structure learning: A randomized feature generation approach},
  author={Van Haaren, Jan and Davis, Jesse},
  booktitle={Twenty-Sixth AAAI Conference on Artificial Intelligence},
  year={2012}
}

@inproceedings{BekkerDCDV15,
	title={Tractable learning for complex probability queries},
	author={Bekker, Jessa and Davis, Jesse and Choi, Arthur and Darwiche, Adnan and Van den Broeck, Guy},
	booktitle={Advances in Neural Information Processing Systems},
	pages={2242--2250},
	year={2015}
}

@article{LarochelleBengioTurian10,
	title={Tractable multivariate binary density estimation and the restricted Boltzmann forest},
	author={Larochelle, Hugo and Bengio, Yoshua and Turian, Joseph},
	journal={Neural computation},
	volume={22},
	number={9},
	pages={2285--2307},
	year={2010},
	publisher={MIT Press}
}


@article{BenjumedaCamposLarranaga19,
	title={Learning Tractable {B}ayesian networks in the space of elimination orders},
	author={Benjumeda, Marco and Bielza, Concha and Larra{\~{n}}aga, Pedro},
	journal={Artificial Intelligence},
	volume={274},
	pages={66--90},
	year={2019},
	publisher={Elsevier}
}


% links to software/tools converted to bib entries to save space

%misc{maxsateval19,
%  title = {{Sources of MaxSAT solvers that participated in MaxSAT 
%            Evaluation 2019}},
%  url = {https://maxsat-evaluations.github.io/2019/descriptions.html},
%  urldate = {2020-06-03}
%}

@misc{bngenerator,
  author = {Ide, Jaime S.},
  title = {{BNGenerator} -- {A} generator for random {B}ayesian network},
  url = {http://sites.poli.usp.br/pmr/ltd/Software/BNGenerator},
  year = {2015},
  urldate = {2020-06-03}
}

@misc{bnconvertor,
  author = {Guo, Haipeng},
  title = {{BBNConvertor} -- {B}ayesian Networks Formats Convertor}},
  url = {http://kdd.cs.ksu.edu/KDD/Groups/Probabilistic-Reasoning/convertor.html},
  year = {2002},
  urldate = {2020-06-03}
}

@misc{blippackage,
  author = {Scanagatta, Mauro},
  title = {{BLIP} -- {B}ayesian Network learning and inference package},
  url = {https://ipg.idsia.ch/software/blip},
  year = {2015},
  urldate = {2020-06-03}
}

@inproceedings{networkxlib,
	author = {Aric A. Hagberg and Daniel A. Schult and Pieter J. Swart},
	title = {Exploring network structure, dynamics, and function using {NetworkX}},
	year = {2008},
	month = Aug,
	urlpdf = {http://math.lanl.gov/~hagberg/Papers/hagberg-2008-exploring.pdf},
	booktitle = {Proceedings of the 7th Python in Science Conference (SciPy2008)},
	editors = {G\"{a}el Varoquaux, Travis Vaught, and Jarrod Millman},
	address = {Pasadena, CA USA},
	pages = {11--15}
}

@inproceedings{pysatpackage,
  author    = {Alexey Ignatiev and
               Antonio Morgado and
               Joao Marques{-}Silva},
  title     = {{PySAT:} {A} {Python} Toolkit for Prototyping
               with {SAT} Oracles},
  booktitle = {SAT},
  pages     = {428--437},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-319-94144-8_26},
  doi       = {10.1007/978-3-319-94144-8_26}
}


@article{VaidyanathanSzeider21, 
    title={Turbocharging Treewidth-Bounded {B}ayesian Network Structure Learning}, 
    volume={35},
    number={5},
    journal={Proceedings of the AAAI Conference on Artificial Intelligence},
    author={Peruvemba Ramaswamy, Vaidyanathan and Szeider, Stefan},
    year={2021}, 
    month={May}, 
    pages={3895-3903} 
}

@incollection{PissingerRopke10,
	title={Large neighborhood search},
	author={Pisinger, David and Ropke, Stefan},
	booktitle={Handbook of metaheuristics},
	pages={399--419},
	year={2010},
	publisher={Springer}
}



@inproceedings{KaskGelfandDechter11,
  author    = {Kalev Kask and
               Andrew Gelfand and
               Lars Otten and
               Rina Dechter},
  title     = {Pushing the Power of Stochastic Greedy Ordering Schemes
                  for Inference in Graphical Models},
  booktitle = {Proceedings of the Twenty-Fifth {AAAI} Conference on
                  Artificial Intelligence ({AAAI} 2011)},
  year      = {2011},
  editor    = {Wolfram Burgard and
               Dan Roth},
  publisher = {{AAAI} Press},
  pages = {54–60}
}


@Article{Kjaerulff92,
  author       = {Uffe K{\ae}rulff },
  title        = {Optimal decomposition of probabilistic networks by
                  simulated annealing},
  journal      = statcomp,
  year 	       = {1992},
  volume    = {2},
  pages     = {7--17},
}



@inproceedings{MeilaJordan96,
  author    = {Marina Meila and Michael I. Jordan},
  editor    = {Michael Mozer and Michael I. Jordan and Thomas Petsche},
  title     = {Triangulation by Continuous Embedding},
  booktitle = {Advances in Neural Information Processing Systems 9,
                  NIPS, Denver, CO, USA, December 2-5, 1996},
  pages     = {557--563},
  publisher = {{MIT} Press},
  year      = {1996},
}

@inproceedings{OttenDechter08b,
  author    = {Lars Otten and Rina Dechter},
  editor    = {David A. McAllester and Petri Myllym{\"{a}}ki},
  title     = {Bounding Search Space Size via (Hyper)tree Decompositions},
  booktitle = {{UAI} 2008, Proceedings of the 24th Conference in
                  Uncertainty in Artificial Intelligence, Helsinki,
                  Finland, July 9-12, 2008},
  pages     = {452--459},
  publisher = {{AUAI} Press},
  year      = {2008},
}

@inproceedings{OttenDechter08a,
  author    = {Lars Otten and Rina Dechter},
  editor    = {Peter J. Stuckey},
  title     = {Refined Bounds for Instance-Based Search Complexity of
                  Counting and Other {\#}{P} Problems},
  booktitle = {Principles and Practice of Constraint Programming, 14th
                  International Conference, {CP} 2008, Sydney,
                  Australia, September 14-18, 2008. Proceedings},
  series    = LNCS,
  volume    = {5202},
  pages     = {576--581},
  publisher = Springer,
  year      = {2008},
  doi       = {10.1007/978-3-540-85958-1_45},
}

@Article{LauritzenSpiegelhalter88,
  author       = {S. L. Lauritzen and D. J. Spiegelhalter},
  title        = {Local Computations with Probabilities on Graphical
                  Structures and Their Application to Expert Systems},
  journal      = JRStatB,
  year 	       = 1988,
  volume    = {50},
  number    = {2},
  pages     = {157--224},
}

@article{EenSorensson06,
  author    = {Niklas E{\'{e}}n and
               Niklas S{\"{o}}rensson},
  title     = {Translating Pseudo-Boolean Constraints into {SAT}},
  journal   = {J. Satisf. Boolean Model. Comput.},
  volume    = {2},
  number    = {1-4},
  pages     = {1--26},
  year      = {2006},
  url       = {https://doi.org/10.3233/sat190014},
  doi       = {10.3233/sat190014},
  timestamp = {Mon, 17 Aug 2020 18:32:39 +0200},
  biburl    = {https://dblp.org/rec/journals/jsat/EenS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


@misc{bnslim-zenodo,
  author       = {Peruvemba Ramaswamy, Vaidyanathan and
                  Szeider, Stefan},
  title        = {{BN-SLIM} source code},
  month        = oct,
  year         = 2021,
  publisher    = {Zenodo},
  version      = {nips21},
  doi          = {10.5281/zenodo.5598257},
  url          = {https://doi.org/10.5281/zenodo.5598257}
}


% ilp based approach conbnsl
@book{KorbNicholson10,
  title={Bayesian artificial intelligence},
  author={Korb, Kevin B and Nicholson, Ann E},
  year={2010},
  publisher={CRC press}
}

% original camml citation
@inproceedings{KennetKorbNicholson01,
  title={Seabreeze prediction using {Bayesian} networks},
  author={Kennett, Russell J and Korb, Kevin B and Nicholson, Ann E},
  booktitle={Pacific-Asia conference on knowledge discovery and data mining},
  pages={148--153},
  year={2001},
  organization={Springer}
}


% ec tree exact conbnsl
@article{ChenSCD16,
  title={Learning {Bayesian} networks with ancestral constraints},
  author={Chen, Eunice Yuh-Jie and Shen, Yujia and Choi, Arthur and Darwiche, Adnan},
  journal={Advances in Neural Information Processing Systems},
  volume={29},
  year={2016}
}

% minobsx approx conbnsl
@inproceedings{LiVanbeek18,
  title={Bayesian network structure learning with side constraints},
  author={Li, Andrew and van Beek, Peter},
  booktitle={International Conference on Probabilistic Graphical Models},
  pages={225--236},
  year={2018},
  organization={PMLR}
}

% sat/smt/asp + markov model
@inproceedings{CoranderJanhunenRintanenNP13,
	title = {Learning {Chordal} {Markov} {Networks} by {Constraint} {Satisfaction}},
	volume = {26},
	urldate = {2022-02-23},
	booktitle = {Advances in {Neural} {Information} {Processing} {Systems}},
	publisher = {Curran Associates, Inc.},
	author = {Corander, Jukka and Janhunen, Tomi and Rintanen, Jussi and Nyman, Henrik and Pensar, Johan},
	year = {2013},
}

% sat-based + causality + relaxed faithfulness assumptions
@article{ZhalamaZhangEberhardtM17,
	title = {{SAT}-based causal discovery under weaker assumptions: 33rd {Conference} on {Uncertainty} in {Artificial} {Intelligence}, {UAI} 2017},
	shorttitle = {{SAT}-based causal discovery under weaker assumptions},
	url = {http://commons.ln.edu.hk/sw_master/6104},
	urldate = {2022-02-23},
	journal = {Proceedings of the 33rd Conference on Uncertainty in Artificial Intelligence (UAI)},
	author = {{Zhalama} and Zhang, Jiji and Eberhardt, Frederick and Mayer, Wolfgang},
	month = jan,
	year = {2017},
	note = {Publisher: Association for Uncertainty in Artificial Intelligence (AUAI)},
}

% asp to learn cyclic causal graphs
@article{HyttinenEberhardtJarvisalo14,
  title={Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming.},
  author={Hyttinen, Antti and Eberhardt, Frederick and J{\"a}rvisalo, Matti},
  booktitle={UAI},
  pages={340--349},
  year={2014}
}

% tailored maxsat solver for cyclic causal graphs
@inproceedings{HyttinenSaikkoJarvisalo17a,
	address = {Melbourne, Australia},
	title = {A {Core}-{Guided} {Approach} to {Learning} {Optimal} {Causal} {Graphs}},
	isbn = {978-0-9992411-0-3},
	url = {https://www.ijcai.org/proceedings/2017/90},
	doi = {10.24963/ijcai.2017/90},
	language = {en},
	urldate = {2022-02-23},
	booktitle = {Proceedings of the {Twenty}-{Sixth} {International} {Joint} {Conference} on {Artificial} {Intelligence}},
	publisher = {International Joint Conferences on Artificial Intelligence Organization},
	author = {Hyttinen, Antti and Saikko, Paul and Järvisalo, Matti},
	month = aug,
	year = {2017},
	pages = {645--651},
}


@article{VaidyanathanSzeider21b,
  title={Learning Fast-Inference {Bayesian} Networks},
  author={Peruvemba Ramaswamy, Vaidyanathan and Szeider, Stefan},
  journal={Advances in Neural Information Processing Systems},
  volume={34},
  year={2021}
}
