BibTeX records: Stephan Kottler

download as .bib file

@inproceedings{DBLP:conf/sat/KottlerZSK12,
  author    = {Stephan Kottler and
               Christian Zielke and
               Paul Seitz and
               Michael Kaufmann},
  editor    = {Alessandro Cimatti and
               Roberto Sebastiani},
  title     = {CoPAn: Exploring Recurring Patterns in Conflict Analysis of {CDCL}
               {SAT} Solvers - (Tool Presentation)},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
               International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7317},
  pages     = {449--455},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-31612-8\_36},
  doi       = {10.1007/978-3-642-31612-8\_36},
  timestamp = {Sun, 02 Jun 2019 21:24:00 +0200},
  biburl    = {https://dblp.org/rec/conf/sat/KottlerZSK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BurgKK12,
  author    = {Sebastian Burg and
               Stephan Kottler and
               Michael Kaufmann},
  editor    = {Alessandro Cimatti and
               Roberto Sebastiani},
  title     = {Creating Industrial-Like {SAT} Instances by Clustering and Reconstruction
               - (Poster Presentation)},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
               International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7317},
  pages     = {471--472},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-31612-8\_40},
  doi       = {10.1007/978-3-642-31612-8\_40},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/sat/BurgKK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/KaufmannK11,
  author    = {Michael Kaufmann and
               Stephan Kottler},
  editor    = {Panos M. Pardalos and
               Steffen Rebennack},
  title     = {Beyond Unit Propagation in {SAT} Solving},
  booktitle = {Experimental Algorithms - 10th International Symposium, {SEA} 2011,
               Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6630},
  pages     = {267--279},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-20662-7\_23},
  doi       = {10.1007/978-3-642-20662-7\_23},
  timestamp = {Tue, 14 May 2019 10:00:42 +0200},
  biburl    = {https://dblp.org/rec/conf/wea/KaufmannK11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Kottler10,
  author    = {Stephan Kottler},
  editor    = {Ofer Strichman and
               Stefan Szeider},
  title     = {{SAT} Solving with Reference Points},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
               International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6175},
  pages     = {143--157},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14186-7\_13},
  doi       = {10.1007/978-3-642-14186-7\_13},
  timestamp = {Sat, 19 Oct 2019 20:28:15 +0200},
  biburl    = {https://dblp.org/rec/conf/sat/Kottler10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/KaufmannK09,
  author    = {Michael Kaufmann and
               Stephan Kottler},
  editor    = {David Eppstein and
               Emden R. Gansner},
  title     = {Proving or Disproving Planar Straight-Line Embeddability onto Given
               Rectangles},
  booktitle = {Graph Drawing, 17th International Symposium, {GD} 2009, Chicago, IL,
               USA, September 22-25, 2009. Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {5849},
  pages     = {419--420},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-11805-0\_44},
  doi       = {10.1007/978-3-642-11805-0\_44},
  timestamp = {Wed, 17 Feb 2021 08:16:51 +0100},
  biburl    = {https://dblp.org/rec/conf/gd/KaufmannK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AlbrechtEHKK09,
  author    = {Benjamin Albrecht and
               Philip Effinger and
               Markus Held and
               Michael Kaufmann and
               Stephan Kottler},
  editor    = {David Eppstein and
               Emden R. Gansner},
  title     = {Visualization of Complex {BPEL} Models},
  booktitle = {Graph Drawing, 17th International Symposium, {GD} 2009, Chicago, IL,
               USA, September 22-25, 2009. Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {5849},
  pages     = {421--423},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-11805-0\_45},
  doi       = {10.1007/978-3-642-11805-0\_45},
  timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/gd/AlbrechtEHKK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KottlerKS08,
  author    = {Stephan Kottler and
               Michael Kaufmann and
               Carsten Sinz},
  editor    = {Hans Kleine B{\"{u}}ning and
               Xishun Zhao},
  title     = {Computation of Renameable Horn Backdoors},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
               International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
               2008. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4996},
  pages     = {154--160},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-79719-7\_15},
  doi       = {10.1007/978-3-540-79719-7\_15},
  timestamp = {Tue, 14 May 2019 10:00:41 +0200},
  biburl    = {https://dblp.org/rec/conf/sat/KottlerKS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KottlerKS08a,
  author    = {Stephan Kottler and
               Michael Kaufmann and
               Carsten Sinz},
  editor    = {Hans Kleine B{\"{u}}ning and
               Xishun Zhao},
  title     = {A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
               International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
               2008. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4996},
  pages     = {161--167},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-79719-7\_16},
  doi       = {10.1007/978-3-540-79719-7\_16},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/sat/KottlerKS08a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/LehmannK06,
  author    = {Katharina Anna Lehmann and
               Stephan Kottler},
  editor    = {Michael Kaufmann and
               Dorothea Wagner},
  title     = {Visualizing Large and Clustered Networks},
  booktitle = {Graph Drawing, 14th International Symposium, {GD} 2006, Karlsruhe,
               Germany, September 18-20, 2006. Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {4372},
  pages     = {240--251},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/978-3-540-70904-6\_24},
  doi       = {10.1007/978-3-540-70904-6\_24},
  timestamp = {Wed, 17 Feb 2021 08:16:51 +0100},
  biburl    = {https://dblp.org/rec/conf/gd/LehmannK06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics