@inproceedings(amilhastre1997computing,
 author       = {J{\'e}r{\^o}me Amilhastre and Philippe Janssen and Marie-Catherine Vilarem},
 year         = {1997},
 title        = {Computing a minimum biclique cover is polynomial for bipartite domino-free graphs},
 booktitle    = {Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms},
 pages        = {36--42},
)
@inproceedings(BiereCCZ99,
 author       = {Armin Biere and Alessandro Cimatti and Edmund~M. Clarke and Yunshan Zhu},
 year         = {1999},
 title        = {Symbolic model checking without BDDs},
 booktitle    = {Proc. Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, {TACAS} '99},
 pages        = {193--207},
 doi          = {10.1007/3-540-49059-0\_14},
)
@article(blum1997fast,
 author       = {Avrim~L Blum and Merrick~L Furst},
 year         = {1997},
 title        = {Fast planning through planning graph analysis},
 journal      = {Artificial Intelligence},
 volume       = {90},
 number       = {1},
 pages        = {281--300},
 doi          = {10.1016/S0004-3702(96)00047-1},
)
@misc(ASP-standard,
 author       = {Francesco Calimeri and Wolfgang Faber and Martin Gebser and Giovambattista Ianni and Roland Kaminski and Thomas Krennwallner and Nicola Leone and Francesco Ricca and Torsten Schaub},
 year         = {2015},
 title        = {{ASP-Core-2} Input Language Format},
 howpublished = {\url{https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.01c.pdf}},
 note         = {ASP Standardization Working Group},
)
@article(DBLP:journals/tplp/CuteriDRS17,
 author       = {Bernardo Cuteri and Carmine Dodaro and Francesco Ricca and Peter Sch{\"{u}}ller},
 year         = {2017},
 title        = {Constraints, lazy constraints, or propagators in {ASP} solving: An empirical analysis},
 journal      = {{TPLP}},
 volume       = {17},
 number       = {5-6},
 pages        = {780--799},
 doi          = {10.1017/S1471068417000254},
)
@book(GareyJ79,
 author       = {M.~R. Garey and David~S. Johnson},
 year         = {1979},
 title        = {Computers and Intractability: {A} Guide to the Theory of NP-Completeness},
 publisher    = {W. H. Freeman},
)
@article(Hochbaum98,
 author       = {Dorit~S. Hochbaum},
 year         = {1998},
 title        = {Approximating clique and biclique problems},
 journal      = {J. Algorithms},
 volume       = {29},
 number       = {1},
 pages        = {174--200},
 doi          = {10.1006/jagm.1998.0964},
)
@inproceedings(howey2004val,
 author       = {Richard Howey and Derek Long and Maria Fox},
 year         = {2004},
 title        = {VAL: Automatic plan validation, continuous effects and mixed initiative planning using {PDDL}},
 booktitle    = {Proc. 16th IEEE Int'l Conference on Tools with Artificial Intelligence},
 pages        = {294--301},
 doi          = {10.1109/ICTAI.2004.120},
)
@inproceedings(DBLP:conf/coco/Karp72,
 author       = {Richard~M. Karp},
 year         = {1972},
 title        = {Reducibility among combinatorial problems},
 booktitle    = {Proc. Symposium on the Complexity of Computer Computations, March 20-22, 1972, at the {IBM} Thomas J. Watson Research Center, Yorktown Heights, New York, {USA}},
 pages        = {85--103},
)
@article(kautz2004satplan04,
 author       = {Henry Kautz},
 year         = {2004},
 title        = {SATPLAN04: Planning as satisfiability},
 journal      = {Working Notes on the Fourth Int'l Planning Competition (IPC-04)},
 pages        = {44--45},
)
@book(DBLP:books/daglib/0023091,
 author       = {Daphne Koller and Nir Friedman},
 year         = {2009},
 title        = {Probabilistic Graphical Models - Principles and Techniques},
 publisher    = {{MIT} Press},
)
@inproceedings(cvpr/MaL12,
 author       = {Tianyang Ma and Longin~Jan Latecki},
 year         = {2012},
 title        = {Maximum weight cliques with mutex constraints for video object segmentation},
 booktitle    = {Proc. 2012 {IEEE} Conference on Computer Vision and Pattern Recognition, Providence, RI, USA, June 16-21, 2012},
 pages        = {670--677},
 doi          = {10.1109/CVPR.2012.6247735},
)
@article(Peeters03,
 author       = {Ren{\'{e}} Peeters},
 year         = {2003},
 title        = {The maximum edge biclique problem is NP-complete},
 journal      = {Discrete Applied Mathematics},
 volume       = {131},
 number       = {3},
 pages        = {651--654},
 doi          = {10.1016/S0166-218X(03)00333-0},
)
@inproceedings(rintanen2006compact,
 author       = {Jussi Rintanen},
 year         = {2006},
 title        = {Compact representation of sets of binary constraints},
 booktitle    = {Proc. 17th European Conference on Artificial Intelligence},
 pages        = {143--147},
)
@inproceedings(robinson2008compact,
 author       = {Nathan Robinson and Charles Gretton and Duc~Nghia Pham and Abdul Sattar},
 year         = {2008},
 title        = {A compact and efficient {SAT} encoding for planning.},
 booktitle    = {Proc. International Conference on Automated Planning and Scheduling},
 pages        = {296--303},
)
@article(robson1986algorithms,
 author       = {John~Michael Robson},
 year         = {1986},
 title        = {Algorithms for maximum independent sets},
 journal      = {Journal of Algorithms},
 volume       = {7},
 number       = {3},
 pages        = {425--440},
 doi          = {10.1016/0196-6774(86)90032-5},
)
@inproceedings(cvpr/RoyT14,
 author       = {Anirban Roy and Sinisa Todorovic},
 year         = {2014},
 title        = {Scene Labeling Using Beam Search under Mutex Constraints},
 booktitle    = {2014 {IEEE} Conference on Computer Vision and Pattern Recognition, {CVPR} 2014, Columbus, OH, USA, June 23-28, 2014},
 pages        = {1178--1185},
 doi          = {10.1109/CVPR.2014.154},
)
@mastersthesis(spies2019,
 author       = {David Spies},
 year         = {2019},
 title        = {Domain-Independent Cost-Optimal Planning in {ASP}},
 school       = {University of Alberta},
 address      = {Edmonton, Canada},
)
@inproceedings(Yannakakis78,
 author       = {Mihalis Yannakakis},
 year         = {1978},
 title        = {Node- and edge-deletion NP-complete problems},
 booktitle    = {Proc. 10th Annual {ACM} Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, {USA}},
 pages        = {253--264},
 doi          = {10.1145/800133.804355},
)