BibTeX record conf/faw/WojciechowskiSW18

download as .bib file

@inproceedings{DBLP:conf/faw/WojciechowskiSW18,
  author       = {Piotr Wojciechowski and
                  K. Subramani and
                  Matthew D. Williamson},
  editor       = {Jianer Chen and
                  Pinyan Lu},
  title        = {Optimal Length Tree-Like Refutations of Linear Feasibility in {UTVPI}
                  Constraints},
  booktitle    = {Frontiers in Algorithmics - 12th International Workshop, {FAW} 2018,
                  Guangzhou, China, May 8-10, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10823},
  pages        = {300--314},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-78455-7\_23},
  doi          = {10.1007/978-3-319-78455-7\_23},
  timestamp    = {Fri, 09 Feb 2024 20:36:01 +0100},
  biburl       = {https://dblp.org/rec/conf/faw/WojciechowskiSW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.