Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Jacques Dark
@inproceedings{DBLP:conf/fsttcs/DarkD023, author = {Jacques Dark and Adithya Diddapur and Christian Konrad}, editor = {Patricia Bouyer and Srikanth Srinivasan}, title = {Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion Setting}, booktitle = {43rd {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2023, December 18-20, 2023, {IIIT} Hyderabad, Telangana, India}, series = {LIPIcs}, volume = {284}, pages = {24:1--24:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2023.24}, doi = {10.4230/LIPICS.FSTTCS.2023.24}, timestamp = {Wed, 13 Dec 2023 14:08:06 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/DarkD023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DarkK20, author = {Jacques Dark and Christian Konrad}, editor = {Shubhangi Saraf}, title = {Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams}, booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31, 2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {169}, pages = {30:1--30:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.CCC.2020.30}, doi = {10.4230/LIPICS.CCC.2020.30}, timestamp = {Tue, 28 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/DarkK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2005-11116, author = {Jacques Dark and Christian Konrad}, title = {Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams}, journal = {CoRR}, volume = {abs/2005.11116}, year = {2020}, url = {https://arxiv.org/abs/2005.11116}, eprinttype = {arXiv}, eprint = {2005.11116}, timestamp = {Tue, 28 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2005-11116.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CormodeDK19, author = {Graham Cormode and Jacques Dark and Christian Konrad}, editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi}, title = {Independent Sets in Vertex-Arrival Streams}, booktitle = {46th International Colloquium on Automata, Languages, and Programming, {ICALP} 2019, July 9-12, 2019, Patras, Greece}, series = {LIPIcs}, volume = {132}, pages = {45:1--45:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.45}, doi = {10.4230/LIPICS.ICALP.2019.45}, timestamp = {Tue, 28 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/CormodeDK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icdt/CormodeD18, author = {Graham Cormode and Jacques Dark}, editor = {Benny Kimelfeld and Yael Amsterdamer}, title = {Fast Sketch-based Recovery of Correlation Outliers}, booktitle = {21st International Conference on Database Theory, {ICDT} 2018, March 26-29, 2018, Vienna, Austria}, series = {LIPIcs}, volume = {98}, pages = {13:1--13:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICDT.2018.13}, doi = {10.4230/LIPICS.ICDT.2018.13}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icdt/CormodeD18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iscopt/CormodeDK18, author = {Graham Cormode and Jacques Dark and Christian Konrad}, editor = {Jon Lee and Giovanni Rinaldi and Ali Ridha Mahjoub}, title = {Approximating the Caro-Wei Bound for Independent Sets in Graph Streams}, booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10856}, pages = {101--114}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-96151-4\_9}, doi = {10.1007/978-3-319-96151-4\_9}, timestamp = {Tue, 28 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iscopt/CormodeDK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-08331, author = {Graham Cormode and Jacques Dark and Christian Konrad}, title = {Independent Sets in Vertex-Arrival Streams}, journal = {CoRR}, volume = {abs/1807.08331}, year = {2018}, url = {http://arxiv.org/abs/1807.08331}, eprinttype = {arXiv}, eprint = {1807.08331}, timestamp = {Tue, 28 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-08331.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CormodeDK17, author = {Graham Cormode and Jacques Dark and Christian Konrad}, title = {Independent Set Size Approximation in Graph Streams}, journal = {CoRR}, volume = {abs/1702.08299}, year = {2017}, url = {http://arxiv.org/abs/1702.08299}, eprinttype = {arXiv}, eprint = {1702.08299}, timestamp = {Tue, 28 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/CormodeDK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1710-01985, author = {Graham Cormode and Jacques Dark}, title = {Fast Sketch-based Recovery of Correlation Outliers}, journal = {CoRR}, volume = {abs/1710.01985}, year = {2017}, url = {http://arxiv.org/abs/1710.01985}, eprinttype = {arXiv}, eprint = {1710.01985}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1710-01985.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.