Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Markus S. Dregi
@article{DBLP:journals/jcss/DrangeDLS22,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus Fanebust Dregi and
Daniel Lokshtanov and
Blair D. Sullivan},
title = {On the threshold of intractability},
journal = {J. Comput. Syst. Sci.},
volume = {124},
pages = {1--25},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.09.003},
doi = {10.1016/J.JCSS.2021.09.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/DrangeDLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DrangeDH16,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Pim van 't Hof},
title = {On the Computational Complexity of Vertex Integrity and Component
Order Connectivity},
journal = {Algorithmica},
volume = {76},
number = {4},
pages = {1181--1202},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0127-x},
doi = {10.1007/S00453-016-0127-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DrangeDH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BodlaenderDDFLP16,
author = {Hans L. Bodlaender and
P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Fedor V. Fomin and
Daniel Lokshtanov and
Michal Pilipczuk},
title = {A c\({}^{\mbox{k}}\) n 5-Approximation Algorithm for Treewidth},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {2},
pages = {317--378},
year = {2016},
url = {https://doi.org/10.1137/130947374},
doi = {10.1137/130947374},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BodlaenderDDFLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/DrangeDS16,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
R. B. Sandeep},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {Compressing Bounded Degree Graphs},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {362--375},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_27},
doi = {10.1007/978-3-662-49529-2\_27},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/DrangeDS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DrangeDFKLPPRVS16,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus Sortland Dregi and
Fedor V. Fomin and
Stephan Kreutzer and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Felix Reidl and
Fernando S{\'{a}}nchez Villaamil and
Saket Saurabh and
Sebastian Siebertz and
Somnath Sikdar},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Kernelization and Sparseness: the Case of Dominating Set},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {31:1--31:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.31},
doi = {10.4230/LIPICS.STACS.2016.31},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DrangeDFKLPPRVS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DrangeDLS15,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus Sortland Dregi and
Daniel Lokshtanov and
Blair D. Sullivan},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {On the Threshold of Intractability},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {411--423},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_35},
doi = {10.1007/978-3-662-48350-3\_35},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/DrangeDLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DrangeDLS15,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus Sortland Dregi and
Daniel Lokshtanov and
Blair D. Sullivan},
title = {On the Threshold of Intractability},
journal = {CoRR},
volume = {abs/1505.00612},
year = {2015},
url = {http://arxiv.org/abs/1505.00612},
eprinttype = {arXiv},
eprint = {1505.00612},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DrangeDLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DregiL14,
author = {Markus Sortland Dregi and
Daniel Lokshtanov},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Parameterized Complexity of Bandwidth on Trees},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {405--416},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_34},
doi = {10.1007/978-3-662-43948-7\_34},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DregiL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DrangeDH14,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus Sortland Dregi and
Pim van 't Hof},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {On the Computational Complexity of Vertex Integrity and Component
Order Connectivity},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {285--297},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_23},
doi = {10.1007/978-3-319-13075-0\_23},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DrangeDH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DrangeDH14,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus Sortland Dregi and
Pim van 't Hof},
title = {On the Computational Complexity of Vertex Integrity},
journal = {CoRR},
volume = {abs/1403.6331},
year = {2014},
url = {http://arxiv.org/abs/1403.6331},
eprinttype = {arXiv},
eprint = {1403.6331},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DrangeDH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DregiL14,
author = {Markus Sortland Dregi and
Daniel Lokshtanov},
title = {Parameterized Complexity of Bandwidth on Trees},
journal = {CoRR},
volume = {abs/1404.7810},
year = {2014},
url = {http://arxiv.org/abs/1404.7810},
eprinttype = {arXiv},
eprint = {1404.7810},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DregiL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DrangeDFKLPPRSVS14,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Fedor V. Fomin and
Stephan Kreutzer and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Felix Reidl and
Saket Saurabh and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
title = {Kernelization and Sparseness: the case of Dominating Set},
journal = {CoRR},
volume = {abs/1411.4575},
year = {2014},
url = {http://arxiv.org/abs/1411.4575},
eprinttype = {arXiv},
eprint = {1411.4575},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DrangeDFKLPPRSVS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BodlaenderDDFLP13,
author = {Hans L. Bodlaender and
P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Fedor V. Fomin and
Daniel Lokshtanov and
Michal Pilipczuk},
title = {An O(c{\^{}}k n) 5-Approximation Algorithm for Treewidth},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {499--508},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.60},
doi = {10.1109/FOCS.2013.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BodlaenderDDFLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-6321,
author = {Hans L. Bodlaender and
P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Fedor V. Fomin and
Daniel Lokshtanov and
Michal Pilipczuk},
title = {A O(c{\^{}}k n) 5-Approximation Algorithm for Treewidth},
journal = {CoRR},
volume = {abs/1304.6321},
year = {2013},
url = {http://arxiv.org/abs/1304.6321},
eprinttype = {arXiv},
eprint = {1304.6321},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-6321.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
