default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jan Arne Telle
@article{DBLP:journals/jmlr/SimonT24,
author = {Hans Ulrich Simon and
Jan Arne Telle},
title = {{MAP-} and MLE-Based Teaching},
journal = {J. Mach. Learn. Res.},
volume = {25},
pages = {96:1--96:34},
year = {2024},
url = {https://jmlr.org/papers/v25/23-1086.html},
timestamp = {Mon, 16 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/SimonT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/SundeHKT24,
author = {Joakim Sunde and
Brigt Arve Toppe H{\aa}vardstun and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
title = {On a Combinatorial Problem Arising in Machine Teaching},
booktitle = {Forty-first International Conference on Machine Learning, {ICML} 2024,
Vienna, Austria, July 21-27, 2024},
publisher = {OpenReview.net},
year = {2024},
url = {https://openreview.net/forum?id=spOpHW1No2},
timestamp = {Mon, 02 Sep 2024 16:45:29 +0200},
biburl = {https://dblp.org/rec/conf/icml/SundeHKT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pkdd/HavardstunFT24,
author = {Brigt Arve Toppe H{\aa}vardstun and
C{\`{e}}sar Ferri and
Jan Arne Telle},
editor = {Albert Bifet and
Povilas Daniusis and
Jesse Davis and
Tomas Krilavicius and
Meelis Kull and
Eirini Ntoutsi and
Kai Puolam{\"{a}}ki and
Indre Zliobaite},
title = {An Interactive Tool for Interpretability of Time Series Classification},
booktitle = {Machine Learning and Knowledge Discovery in Databases. Research Track
and Demo Track - European Conference, {ECML} {PKDD} 2024, Vilnius,
Lithuania, September 9-13, 2024, Proceedings, Part {VIII}},
series = {Lecture Notes in Computer Science},
volume = {14948},
pages = {399--403},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-70371-3\_28},
doi = {10.1007/978-3-031-70371-3\_28},
timestamp = {Wed, 11 Sep 2024 11:32:10 +0200},
biburl = {https://dblp.org/rec/conf/pkdd/HavardstunFT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-12711,
author = {C{\`{e}}sar Ferri and
Dar{\'{\i}}o Garigliotti and
Brigt Arve Toppe H{\aa}vardstun and
Jos{\'{e}} Hern{\'{a}}ndez{-}Orallo and
Jan Arne Telle},
title = {When Redundancy Matters: Machine Teaching of Representations},
journal = {CoRR},
volume = {abs/2401.12711},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.12711},
doi = {10.48550/ARXIV.2401.12711},
eprinttype = {arXiv},
eprint = {2401.12711},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-12711.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-04907,
author = {Brigt Arve Toppe H{\aa}vardstun and
Jan Kratochv{\'{\i}}l and
Joakim Sunde and
Jan Arne Telle},
title = {On a Combinatorial Problem Arising in Machine Teaching},
journal = {CoRR},
volume = {abs/2402.04907},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.04907},
doi = {10.48550/ARXIV.2402.04907},
eprinttype = {arXiv},
eprint = {2402.04907},
timestamp = {Thu, 15 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-04907.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BodlaenderJT23,
author = {Hans L. Bodlaender and
Lars Jaffke and
Jan Arne Telle},
title = {Typical Sequences Revisited - Computing Width Parameters of Graphs},
journal = {Theory Comput. Syst.},
volume = {67},
number = {1},
pages = {52--88},
year = {2023},
url = {https://doi.org/10.1007/s00224-021-10030-3},
doi = {10.1007/S00224-021-10030-3},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BodlaenderJT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pkdd/HavardstunFHPT23,
author = {Brigt Arve Toppe H{\aa}vardstun and
C{\`{e}}sar Ferri and
Jos{\'{e}} Hern{\'{a}}ndez{-}Orallo and
Pekka Parviainen and
Jan Arne Telle},
editor = {Danai Koutra and
Claudia Plant and
Manuel Gomez Rodriguez and
Elena Baralis and
Francesco Bonchi},
title = {{XAI} with Machine Teaching When Humans Are (Not) Informed About the
Irrelevant Features},
booktitle = {Machine Learning and Knowledge Discovery in Databases: Research Track
- European Conference, {ECML} {PKDD} 2023, Turin, Italy, September
18-22, 2023, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {14171},
pages = {378--393},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43418-1\_23},
doi = {10.1007/978-3-031-43418-1\_23},
timestamp = {Wed, 20 Sep 2023 23:28:46 +0200},
biburl = {https://dblp.org/rec/conf/pkdd/HavardstunFHPT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-05252,
author = {Hans Ulrich Simon and
Jan Arne Telle},
title = {{MAP-} and MLE-Based Teaching},
journal = {CoRR},
volume = {abs/2307.05252},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.05252},
doi = {10.48550/ARXIV.2307.05252},
eprinttype = {arXiv},
eprint = {2307.05252},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-05252.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergougnouxPT22,
author = {Benjamin Bergougnoux and
Charis Papadopoulos and
Jan Arne Telle},
title = {Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded
Mim-Width},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1385--1417},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00936-w},
doi = {10.1007/S00453-022-00936-W},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergougnouxPT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeT22,
author = {Van Bang Le and
Jan Arne Telle},
title = {The perfect matching cut problem revisited},
journal = {Theor. Comput. Sci.},
volume = {931},
pages = {117--130},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.07.035},
doi = {10.1016/J.TCS.2022.07.035},
timestamp = {Fri, 09 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LeT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/FerriHT22,
author = {C{\`{e}}sar Ferri and
Jos{\'{e}} Hern{\'{a}}ndez{-}Orallo and
Jan Arne Telle},
editor = {Luc De Raedt},
title = {Non-Cheating Teaching Revisited: {A} New Probabilistic Machine Teaching
Model},
booktitle = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July
2022},
pages = {2973--2979},
publisher = {ijcai.org},
year = {2022},
url = {https://doi.org/10.24963/ijcai.2022/412},
doi = {10.24963/IJCAI.2022/412},
timestamp = {Wed, 27 Jul 2022 16:43:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/FerriHT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JaffkeKT22,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {Classes of Intersection Digraphs with Good Algorithmic Properties},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {38:1--38:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.38},
doi = {10.4230/LIPICS.STACS.2022.38},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JaffkeKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BergougnouxHTV22,
author = {Benjamin Bergougnoux and
Svein H{\o}gemo and
Jan Arne Telle and
Martin Vatshelle},
editor = {Michael A. Bekos and
Michael Kaufmann},
title = {Recognition of Linear and Star Variants of Leaf Powers is in {P}},
booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {70--83},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15914-5\_6},
doi = {10.1007/978-3-031-15914-5\_6},
timestamp = {Fri, 07 Oct 2022 15:35:12 +0200},
biburl = {https://dblp.org/rec/conf/wg/BergougnouxHTV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenT21,
author = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Special Issue Dedicated to the 14th International Symposium on Parameterized
and Exact Computation},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2469--2470},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00853-4},
doi = {10.1007/S00453-021-00853-4},
timestamp = {Tue, 27 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HogemoBBPT21,
author = {Svein H{\o}gemo and
Benjamin Bergougnoux and
Ulrik Brandes and
Christophe Paul and
Jan Arne Telle},
editor = {Evripidis Bampis and
Aris Pagourtzis},
title = {On Dasgupta's Hierarchical Clustering Objective and Its Relation to
Other Graph Parameters},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium,
{FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12867},
pages = {287--300},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86593-1\_20},
doi = {10.1007/978-3-030-86593-1\_20},
timestamp = {Tue, 14 Sep 2021 19:09:35 +0200},
biburl = {https://dblp.org/rec/conf/fct/HogemoBBPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeT21,
author = {Van Bang Le and
Jan Arne Telle},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {The Perfect Matching Cut Problem Revisited},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {182--194},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_14},
doi = {10.1007/978-3-030-86838-3\_14},
timestamp = {Tue, 21 Sep 2021 19:14:12 +0200},
biburl = {https://dblp.org/rec/conf/wg/LeT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-01413,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
title = {Classes of intersection digraphs with good algorithmic properties},
journal = {CoRR},
volume = {abs/2105.01413},
year = {2021},
url = {https://arxiv.org/abs/2105.01413},
eprinttype = {arXiv},
eprint = {2105.01413},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-01413.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-12093,
author = {Svein H{\o}gemo and
Benjamin Bergougnoux and
Ulrik Brandes and
Christophe Paul and
Jan Arne Telle},
title = {On Dasgupta's hierarchical clustering objective and its relation to
other graph parameters},
journal = {CoRR},
volume = {abs/2105.12093},
year = {2021},
url = {https://arxiv.org/abs/2105.12093},
eprinttype = {arXiv},
eprint = {2105.12093},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-12093.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-12407,
author = {Benjamin Bergougnoux and
Svein H{\o}gemo and
Jan Arne Telle and
Martin Vatshelle},
title = {On Alternative Models for Leaf Powers},
journal = {CoRR},
volume = {abs/2105.12407},
year = {2021},
url = {https://arxiv.org/abs/2105.12407},
eprinttype = {arXiv},
eprint = {2105.12407},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-12407.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-06399,
author = {Van Bang Le and
Jan Arne Telle},
title = {The Perfect Matching Cut Problem Revisited},
journal = {CoRR},
volume = {abs/2107.06399},
year = {2021},
url = {https://arxiv.org/abs/2107.06399},
eprinttype = {arXiv},
eprint = {2107.06399},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-06399.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JaffkeKT20,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
title = {Mim-Width {II.} The Feedback Vertex Set Problem},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {118--145},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00607-3},
doi = {10.1007/S00453-019-00607-3},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JaffkeKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JaffkeKT20,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
title = {Mim-Width I. Induced path problems},
journal = {Discret. Appl. Math.},
volume = {278},
pages = {153--168},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.06.026},
doi = {10.1016/J.DAM.2019.06.026},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/JaffkeKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/Hernandez-Orallo20,
author = {Jos{\'{e}} Hern{\'{a}}ndez{-}Orallo and
Jan Arne Telle},
editor = {Giuseppe De Giacomo and
Alejandro Catal{\'{a}} and
Bistra Dilkina and
Michela Milano and
Sen{\'{e}}n Barro and
Alberto Bugar{\'{\i}}n and
J{\'{e}}r{\^{o}}me Lang},
title = {Finite and Confident Teaching in Expectation: Sampling from Infinite
Concept Classes},
booktitle = {{ECAI} 2020 - 24th European Conference on Artificial Intelligence,
29 August-8 September 2020, Santiago de Compostela, Spain, August
29 - September 8, 2020 - Including 10th Conference on Prestigious
Applications of Artificial Intelligence {(PAIS} 2020)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {325},
pages = {1182--1189},
publisher = {{IOS} Press},
year = {2020},
url = {https://doi.org/10.3233/FAIA200217},
doi = {10.3233/FAIA200217},
timestamp = {Fri, 09 Apr 2021 18:50:05 +0200},
biburl = {https://dblp.org/rec/conf/ecai/Hernandez-Orallo20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HogemoPT20,
author = {Svein H{\o}gemo and
Christophe Paul and
Jan Arne Telle},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Hierarchical Clusterings of Unweighted Graphs},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {47:1--47:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.47},
doi = {10.4230/LIPICS.MFCS.2020.47},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HogemoPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderJT20,
author = {Hans L. Bodlaender and
Lars Jaffke and
Jan Arne Telle},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Typical Sequences Revisited - Computing Width Parameters of Graphs},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {57:1--57:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.57},
doi = {10.4230/LIPICS.STACS.2020.57},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderJT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BergougnouxPT20,
author = {Benjamin Bergougnoux and
Charis Papadopoulos and
Jan Arne Telle},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded
Mim-width},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {388--400},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_31},
doi = {10.1007/978-3-030-60440-0\_31},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BergougnouxPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-03061,
author = {Svein H{\o}gemo and
Christophe Paul and
Jan Arne Telle},
title = {Hierarchical Clusterings of Unweighted Graphs},
journal = {CoRR},
volume = {abs/2008.03061},
year = {2020},
url = {https://arxiv.org/abs/2008.03061},
eprinttype = {arXiv},
eprint = {2008.03061},
timestamp = {Fri, 14 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-03061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/TelleHF19,
author = {Jan Arne Telle and
Jos{\'{e}} Hern{\'{a}}ndez{-}Orallo and
C{\`{e}}sar Ferri},
title = {The teaching size: computable teachers and learners for universal
languages},
journal = {Mach. Learn.},
volume = {108},
number = {8-9},
pages = {1653--1675},
year = {2019},
url = {https://doi.org/10.1007/s10994-019-05821-2},
doi = {10.1007/S10994-019-05821-2},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/TelleHF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TelleV19,
author = {Jan Arne Telle and
Yngve Villanger},
title = {{FPT} algorithms for domination in sparse graphs and beyond},
journal = {Theor. Comput. Sci.},
volume = {770},
pages = {62--68},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.10.030},
doi = {10.1016/J.TCS.2018.10.030},
timestamp = {Wed, 08 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/TelleV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JaffkeKST19,
author = {Lars Jaffke and
O{-}joung Kwon and
Torstein J. F. Str{\o}mme and
Jan Arne Telle},
title = {Mim-width {III.} Graph powers and generalized distance domination
problems},
journal = {Theor. Comput. Sci.},
volume = {796},
pages = {216--236},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.09.012},
doi = {10.1016/J.TCS.2019.09.012},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/JaffkeKST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HogemoTV19,
author = {Svein H{\o}gemo and
Jan Arne Telle and
Erlend Raa V{\aa}gset},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Linear MIM-Width of Trees},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {218--231},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_17},
doi = {10.1007/978-3-030-30786-8\_17},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HogemoTV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2019,
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-129-0},
isbn = {978-3-95977-129-0},
timestamp = {Wed, 21 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-03643,
author = {Hans L. Bodlaender and
Lars Jaffke and
Jan Arne Telle},
title = {Typical Sequences Revisited - Algorithms for Linear Orderings of Series
Parallel Digraphs},
journal = {CoRR},
volume = {abs/1905.03643},
year = {2019},
url = {http://arxiv.org/abs/1905.03643},
eprinttype = {arXiv},
eprint = {1905.03643},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-03643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04132,
author = {Svein H{\o}gemo and
Jan Arne Telle and
Erlend Raa V{\aa}gset},
title = {Linear MIM-Width of Trees},
journal = {CoRR},
volume = {abs/1907.04132},
year = {2019},
url = {http://arxiv.org/abs/1907.04132},
eprinttype = {arXiv},
eprint = {1907.04132},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04132.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00887,
author = {Benjamin Bergougnoux and
Charis Papadopoulos and
Jan Arne Telle},
title = {Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded
Mim-width},
journal = {CoRR},
volume = {abs/1910.00887},
year = {2019},
url = {http://arxiv.org/abs/1910.00887},
eprinttype = {arXiv},
eprint = {1910.00887},
timestamp = {Wed, 09 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-00887.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JeongST18,
author = {Jisu Jeong and
Sigve Hortemo S{\ae}ther and
Jan Arne Telle},
title = {Maximum matching width: New characterizations and a fast algorithm
for dominating set},
journal = {Discret. Appl. Math.},
volume = {248},
pages = {114--124},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.09.019},
doi = {10.1016/J.DAM.2017.09.019},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JeongST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/JaffkeKST18,
author = {Lars Jaffke and
O{-}joung Kwon and
Torstein J. F. Str{\o}mme and
Jan Arne Telle},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Generalized Distance Domination Problems and Their Complexity on Graphs
of Bounded mim-width},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {6:1--6:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.6},
doi = {10.4230/LIPICS.IPEC.2018.6},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/JaffkeKST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JaffkeKT18,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs
of Bounded Mim-Width},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {42:1--42:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.42},
doi = {10.4230/LIPICS.STACS.2018.42},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/JaffkeKT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-03514,
author = {Lars Jaffke and
O{-}joung Kwon and
Torstein J. F. Str{\o}mme and
Jan Arne Telle},
title = {Generalized distance domination problems and their complexity on graphs
of bounded mim-width},
journal = {CoRR},
volume = {abs/1803.03514},
year = {2018},
url = {http://arxiv.org/abs/1803.03514},
eprinttype = {arXiv},
eprint = {1803.03514},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-03514.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-07121,
author = {Jos{\'{e}} Hern{\'{a}}ndez{-}Orallo and
Jan Arne Telle},
title = {Finite Biased Teaching with Infinite Concept Classes},
journal = {CoRR},
volume = {abs/1804.07121},
year = {2018},
url = {http://arxiv.org/abs/1804.07121},
eprinttype = {arXiv},
eprint = {1804.07121},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-07121.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/JaffkeBHT17,
author = {Lars Jaffke and
Hans L. Bodlaender and
Pinar Heggernes and
Jan Arne Telle},
title = {Definability equals recognizability for k-outerplanar graphs and l-chordal
partial k-trees},
journal = {Eur. J. Comb.},
volume = {66},
pages = {191--234},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.06.025},
doi = {10.1016/J.EJC.2017.06.025},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/JaffkeBHT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KangKST17,
author = {Dong Yeap Kang and
O{-}joung Kwon and
Torstein J. F. Str{\o}mme and
Jan Arne Telle},
title = {A width parameter useful for chordal and co-comparability graphs},
journal = {Theor. Comput. Sci.},
volume = {704},
pages = {1--17},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.09.006},
doi = {10.1016/J.TCS.2017.09.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KangKST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/JaffkeKT17,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Polynomial-Time Algorithms for the Longest Induced Path and Induced
Disjoint Paths Problems on Graphs of Bounded Mim-Width},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {21:1--21:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.21},
doi = {10.4230/LIPICS.IPEC.2017.21},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/JaffkeKT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/KangKST17,
author = {Dong Yeap Kang and
O{-}joung Kwon and
Torstein J. F. Str{\o}mme and
Jan Arne Telle},
editor = {Sheung{-}Hung Poon and
Md. Saidur Rahman and
Hsu{-}Chun Yen},
title = {A Width Parameter Useful for Chordal and Co-comparability Graphs},
booktitle = {{WALCOM:} Algorithms and Computation, 11th International Conference
and Workshops, {WALCOM} 2017, Hsinchu, Taiwan, March 29-31, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10167},
pages = {93--105},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53925-6\_8},
doi = {10.1007/978-3-319-53925-6\_8},
timestamp = {Tue, 21 Mar 2023 20:55:51 +0100},
biburl = {https://dblp.org/rec/conf/walcom/KangKST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04536,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
title = {Polynomial-time algorithms for the Longest Induced Path and Induced
Disjoint Paths problems on graphs of bounded mim-width},
journal = {CoRR},
volume = {abs/1708.04536},
year = {2017},
url = {http://arxiv.org/abs/1708.04536},
eprinttype = {arXiv},
eprint = {1708.04536},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-04536.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-07148,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
title = {A unified polynomial-time algorithm for Feedback Vertex Set on graphs
of bounded mim-width},
journal = {CoRR},
volume = {abs/1710.07148},
year = {2017},
url = {http://arxiv.org/abs/1710.07148},
eprinttype = {arXiv},
eprint = {1710.07148},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-07148.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-05157,
author = {Lars Jaffke and
O{-}joung Kwon and
Jan Arne Telle},
title = {A note on the complexity of Feedback Vertex Set parameterized by mim-width},
journal = {CoRR},
volume = {abs/1711.05157},
year = {2017},
url = {http://arxiv.org/abs/1711.05157},
eprinttype = {arXiv},
eprint = {1711.05157},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-05157.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SaetherT16,
author = {Sigve Hortemo S{\ae}ther and
Jan Arne Telle},
title = {Between Treewidth and Clique-Width},
journal = {Algorithmica},
volume = {75},
number = {1},
pages = {218--253},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0033-7},
doi = {10.1007/S00453-015-0033-7},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SaetherT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KratochvilTT16,
author = {Jan Kratochv{\'{\i}}l and
Jan Arne Telle and
Marek Tesar},
title = {Computational complexity of covering three-vertex multigraphs},
journal = {Theor. Comput. Sci.},
volume = {609},
pages = {104--117},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.09.013},
doi = {10.1016/J.TCS.2015.09.013},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KratochvilTT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GaspersPST16,
author = {Serge Gaspers and
Christos H. Papadimitriou and
Sigve Hortemo S{\ae}ther and
Jan Arne Telle},
editor = {Jiong Guo and
Danny Hermelin},
title = {On Satisfiability Problems with a Linear Structure},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.14},
doi = {10.4230/LIPICS.IPEC.2016.14},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/GaspersPST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GaspersPST16,
author = {Serge Gaspers and
Christos H. Papadimitriou and
Sigve Hortemo S{\ae}ther and
Jan Arne Telle},
title = {On Satisfiability Problems with a Linear Structure},
journal = {CoRR},
volume = {abs/1602.07876},
year = {2016},
url = {http://arxiv.org/abs/1602.07876},
eprinttype = {arXiv},
eprint = {1602.07876},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GaspersPST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KangKST16,
author = {Dong Yeap Kang and
O{-}joung Kwon and
Torstein J. F. Str{\o}mme and
Jan Arne Telle},
title = {Sim-width and induced minors},
journal = {CoRR},
volume = {abs/1606.08087},
year = {2016},
url = {http://arxiv.org/abs/1606.08087},
eprinttype = {arXiv},
eprint = {1606.08087},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KangKST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BruhnCST15,
author = {Henning Bruhn and
Pierre Charbit and
Oliver Schaudt and
Jan Arne Telle},
title = {The graph formulation of the union-closed sets conjecture},
journal = {Eur. J. Comb.},
volume = {43},
pages = {210--219},
year = {2015},
url = {https://doi.org/10.1016/j.ejc.2014.08.030},
doi = {10.1016/J.EJC.2014.08.030},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BruhnCST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/NesetrilST15,
author = {Jaroslav Nesetril and
Oriol Serra and
Jan Arne Telle},
title = {Preface},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {1--2},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.001},
doi = {10.1016/J.ENDM.2015.06.001},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/NesetrilST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BodlaenderHT15,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Jan Arne Telle},
title = {Recognizability Equals Definability for Graphs of Bounded Treewidth
and Bounded Chordality},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {559--568},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.076},
doi = {10.1016/J.ENDM.2015.06.076},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BodlaenderHT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/SaetherTV15,
author = {Sigve Hortemo S{\ae}ther and
Jan Arne Telle and
Martin Vatshelle},
title = {Solving {\#}SAT and {MAXSAT} by Dynamic Programming},
journal = {J. Artif. Intell. Res.},
volume = {54},
pages = {59--82},
year = {2015},
url = {https://doi.org/10.1613/jair.4831},
doi = {10.1613/JAIR.4831},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/SaetherTV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/JeongST15,
author = {Jisu Jeong and
Sigve Hortemo S{\ae}ther and
Jan Arne Telle},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Maximum Matching Width: New Characterizations and a Fast Algorithm
for Dominating Set},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {212--223},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.212},
doi = {10.4230/LIPICS.IPEC.2015.212},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/JeongST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JeongST15,
author = {Jisu Jeong and
Sigve Hortemo S{\ae}ther and
Jan Arne Telle},
title = {Maximum matching width: new characterizations and a fast algorithm
for dominating set},
journal = {CoRR},
volume = {abs/1507.02384},
year = {2015},
url = {http://arxiv.org/abs/1507.02384},
eprinttype = {arXiv},
eprint = {1507.02384},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JeongST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KratochvilTT14,
author = {Jan Kratochv{\'{\i}}l and
Jan Arne Telle and
Marek Tesar},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Computational Complexity of Covering Three-Vertex Multigraphs},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {493--504},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_42},
doi = {10.1007/978-3-662-44465-8\_42},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/KratochvilTT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SaetherTV14,
author = {Sigve Hortemo S{\ae}ther and
Jan Arne Telle and
Martin Vatshelle},
editor = {Carsten Sinz and
Uwe Egly},
title = {Solving MaxSAT and {\#}SAT on Structured {CNF} Formulas},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2014 - 17th
International Conference, Held as Part of the Vienna Summer of Logic,
{VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8561},
pages = {16--31},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09284-3\_3},
doi = {10.1007/978-3-319-09284-3\_3},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/SaetherTV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/SaetherT14,
author = {Sigve Hortemo S{\ae}ther and
Jan Arne Telle},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Between Treewidth and Clique-Width},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {396--407},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_33},
doi = {10.1007/978-3-319-12340-0\_33},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/SaetherT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SaetherTV14,
author = {Sigve Hortemo S{\ae}ther and
Jan Arne Telle and
Martin Vatshelle},
title = {Solving MaxSAT and {\#}SAT on structured {CNF} formulas},
journal = {CoRR},
volume = {abs/1402.6485},
year = {2014},
url = {http://arxiv.org/abs/1402.6485},
eprinttype = {arXiv},
eprint = {1402.6485},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SaetherTV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SaetherT14,
author = {Sigve Hortemo S{\ae}ther and
Jan Arne Telle},
title = {Between Treewidth and Clique-width},
journal = {CoRR},
volume = {abs/1404.7758},
year = {2014},
url = {http://arxiv.org/abs/1404.7758},
eprinttype = {arXiv},
eprint = {1404.7758},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SaetherT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Bui-XuanSTV13,
author = {Binh{-}Minh Bui{-}Xuan and
Ondrej Such{\'{y}} and
Jan Arne Telle and
Martin Vatshelle},
title = {Feedback vertex set on graphs of low clique-width},
journal = {Eur. J. Comb.},
volume = {34},
number = {3},
pages = {666--679},
year = {2013},
url = {https://doi.org/10.1016/j.ejc.2012.07.023},
doi = {10.1016/J.EJC.2012.07.023},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Bui-XuanSTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/OweST13,
author = {Olaf Owe and
Martin Steffen and
Jan Arne Telle},
title = {The 18th International Symposium on Fundamentals of Computation Theory},
journal = {Inf. Comput.},
volume = {231},
pages = {1--2},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2013.08.001},
doi = {10.1016/J.IC.2013.08.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/OweST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bui-XuanTV13,
author = {Binh{-}Minh Bui{-}Xuan and
Jan Arne Telle and
Martin Vatshelle},
title = {Fast dynamic programming for locally checkable vertex subset and vertex
partitioning problems},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {66--76},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.01.009},
doi = {10.1016/J.TCS.2013.01.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bui-XuanTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/RabinovichTV13,
author = {Yuri Rabinovich and
Jan Arne Telle and
Martin Vatshelle},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {Upper Bounds on Boolean-Width with Applications to Exact Algorithms},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {308--320},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_26},
doi = {10.1007/978-3-319-03898-8\_26},
timestamp = {Sun, 04 Aug 2024 19:43:27 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/RabinovichTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/TelleV13,
author = {Jan Arne Telle and
Yngve Villanger},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Connecting Terminals and 2-Disjoint Connected Subgraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {418--428},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_36},
doi = {10.1007/978-3-642-45043-3\_36},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/TelleV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-2506,
author = {Jan Arne Telle and
Yngve Villanger},
title = {Connecting Terminals and 2-Disjoint Connected Subgraphs},
journal = {CoRR},
volume = {abs/1301.2506},
year = {2013},
url = {http://arxiv.org/abs/1301.2506},
eprinttype = {arXiv},
eprint = {1301.2506},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-2506.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MeisterT12,
author = {Daniel Meister and
Jan Arne Telle},
title = {Chordal digraphs},
journal = {Theor. Comput. Sci.},
volume = {463},
pages = {73--83},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.06.019},
doi = {10.1016/J.TCS.2012.06.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MeisterT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Telle12,
author = {Jan Arne Telle},
editor = {Hans L. Bodlaender and
Rod Downey and
Fedor V. Fomin and
D{\'{a}}niel Marx},
title = {Mike Fellows: Weaving the Web of Mathematics and Adventure},
booktitle = {The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7370},
pages = {74--79},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30891-8\_7},
doi = {10.1007/978-3-642-30891-8\_7},
timestamp = {Mon, 03 Jan 2022 22:35:50 +0100},
biburl = {https://dblp.org/rec/conf/birthday/Telle12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/TelleV12,
author = {Jan Arne Telle and
Yngve Villanger},
editor = {Leah Epstein and
Paolo Ferragina},
title = {{FPT} Algorithms for Domination in Biclique-Free Graphs},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {802--812},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_69},
doi = {10.1007/978-3-642-33090-2\_69},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/TelleV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FominKLMT11,
author = {Fedor V. Fomin and
Jan Kratochv{\'{\i}}l and
Daniel Lokshtanov and
Federico Mancini and
Jan Arne Telle},
title = {On the complexity of reconstructing \emph{H}-free graphs from their
Star Systems},
journal = {J. Graph Theory},
volume = {68},
number = {2},
pages = {113--124},
year = {2011},
url = {https://doi.org/10.1002/jgt.20544},
doi = {10.1002/JGT.20544},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FominKLMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bui-XuanTV11,
author = {Binh{-}Minh Bui{-}Xuan and
Jan Arne Telle and
Martin Vatshelle},
title = {Boolean-width of graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5187--5204},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.022},
doi = {10.1016/J.TCS.2011.05.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bui-XuanTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HvidevoldSTV11,
author = {Eivind Magnus Hvidevold and
Sadia Sharmin and
Jan Arne Telle and
Martin Vatshelle},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Finding Good Decompositions for Dynamic Programming on Dense Graphs},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {219--231},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_18},
doi = {10.1007/978-3-642-28050-4\_18},
timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HvidevoldSTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fct/2011,
editor = {Olaf Owe and
Martin Steffen and
Jan Arne Telle},
title = {Fundamentals of Computation Theory - 18th International Symposium,
{FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6914},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22953-4},
doi = {10.1007/978-3-642-22953-4},
isbn = {978-3-642-22952-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MeisterTV10,
author = {Daniel Meister and
Jan Arne Telle and
Martin Vatshelle},
title = {Recognizing digraphs of Kelly-width 2},
journal = {Discret. Appl. Math.},
volume = {158},
number = {7},
pages = {741--746},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.09.018},
doi = {10.1016/J.DAM.2009.09.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MeisterTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bui-XuanTV10,
author = {Binh{-}Minh Bui{-}Xuan and
Jan Arne Telle and
Martin Vatshelle},
title = {H-join decomposable graphs and algorithms with runtime single exponential
in rankwidth},
journal = {Discret. Appl. Math.},
volume = {158},
number = {7},
pages = {809--819},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.09.009},
doi = {10.1016/J.DAM.2009.09.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bui-XuanTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AdlerBRRTV10,
author = {Isolde Adler and
Binh{-}Minh Bui{-}Xuan and
Yuri Rabinovich and
Gabriel Renault and
Jan Arne Telle and
Martin Vatshelle},
editor = {Dimitrios M. Thilikos},
title = {On the Boolean-Width of a Graph: Structure and Applications},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {159--170},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_16},
doi = {10.1007/978-3-642-16926-7\_16},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/AdlerBRRTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HeggernesLNPT10,
author = {Pinar Heggernes and
Daniel Lokshtanov and
Jesper Nederlof and
Christophe Paul and
Jan Arne Telle},
editor = {Dimitrios M. Thilikos},
title = {Generalized Graph Clustering: Recognizing (\emph{p}, \emph{q})-Cluster
Graphs},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {171--183},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_17},
doi = {10.1007/978-3-642-16926-7\_17},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/HeggernesLNPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PaulT09,
author = {Christophe Paul and
Jan Arne Telle},
title = {Branchwidth of chordal graphs},
journal = {Discret. Appl. Math.},
volume = {157},
number = {12},
pages = {2718--2725},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.08.006},
doi = {10.1016/J.DAM.2008.08.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PaulT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DornT09,
author = {Frederic Dorn and
Jan Arne Telle},
title = {Semi-nice tree-decompositions: The best of branchwidth, treewidth
and pathwidth with one algorithm},
journal = {Discret. Appl. Math.},
volume = {157},
number = {12},
pages = {2737--2746},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.08.023},
doi = {10.1016/J.DAM.2008.08.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DornT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PaulT09,
author = {Christophe Paul and
Jan Arne Telle},
title = {Edge-maximal graphs of branchwidth k: The k-branches},
journal = {Discret. Math.},
volume = {309},
number = {6},
pages = {1467--1475},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.02.030},
doi = {10.1016/J.DISC.2008.02.030},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/PaulT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VillangerHPT09,
author = {Yngve Villanger and
Pinar Heggernes and
Christophe Paul and
Jan Arne Telle},
title = {Interval Completion Is Fixed Parameter Tractable},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {5},
pages = {2007--2020},
year = {2009},
url = {https://doi.org/10.1137/070710913},
doi = {10.1137/070710913},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/VillangerHPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Bui-XuanTV09,
author = {Binh{-}Minh Bui{-}Xuan and
Jan Arne Telle and
Martin Vatshelle},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Feedback Vertex Set on Graphs of Low Cliquewidth},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {113--124},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_14},
doi = {10.1007/978-3-642-10217-2\_14},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Bui-XuanTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Bui-XuanTV09,
author = {Binh{-}Minh Bui{-}Xuan and
Jan Arne Telle and
Martin Vatshelle},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {Boolean-Width of Graphs},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {61--74},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_5},
doi = {10.1007/978-3-642-11269-0\_5},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Bui-XuanTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MeisterT09,
author = {Daniel Meister and
Jan Arne Telle},
editor = {Christophe Paul and
Michel Habib},
title = {Chordal Digraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {273--284},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_24},
doi = {10.1007/978-3-642-11409-0\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/MeisterT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0903-4796,
author = {Binh{-}Minh Bui{-}Xuan and
Jan Arne Telle and
Martin Vatshelle},
title = {Fast {FPT} algorithms for vertex subset and vertex partitioning problems
using neighborhood unions},
journal = {CoRR},
volume = {abs/0903.4796},
year = {2009},
url = {http://arxiv.org/abs/0903.4796},
eprinttype = {arXiv},
eprint = {0903.4796},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0903-4796.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/SloperT08,
author = {Christian Sloper and
Jan Arne Telle},
title = {An Overview of Techniques for Designing Parameterized Algorithms},
journal = {Comput. J.},
volume = {51},
number = {1},
pages = {122--136},
year = {2008},
url = {https://doi.org/10.1093/comjnl/bxm038},
doi = {10.1093/COMJNL/BXM038},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/SloperT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FialaPT08,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma and
Jan Arne Telle},
title = {Locally constrained graph homomorphisms and equitable partitions},
journal = {Eur. J. Comb.},
volume = {29},
number = {4},
pages = {850--880},
year = {2008},
url = {https://doi.org/10.1016/j.ejc.2007.11.006},
doi = {10.1016/J.EJC.2007.11.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FialaPT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FellowsMRST08,
author = {Michael R. Fellows and
Daniel Meister and
Frances A. Rosamond and
R. Sritharan and
Jan Arne Telle},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {Leaf Powers and Their Properties: Using the Trees},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {402--413},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_37},
doi = {10.1007/978-3-540-92182-0\_37},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FellowsMRST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FominKLMT08,
author = {Fedor V. Fomin and
Jan Kratochv{\'{\i}}l and
Daniel Lokshtanov and
Federico Mancini and
Jan Arne Telle},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {On the Complexity of Reconstructing {H} -free Graphs from Their Star
Systems},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {194--205},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_17},
doi = {10.1007/978-3-540-78773-0\_17},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/FominKLMT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HeggernesPTV07,
author = {Pinar Heggernes and
Christophe Paul and
Jan Arne Telle and
Yngve Villanger},
editor = {David S. Johnson and
Uriel Feige},
title = {Interval completion with few edges},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {374--381},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250847},
doi = {10.1145/1250790.1250847},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HeggernesPTV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MeisterTV07,
author = {Daniel Meister and
Jan Arne Telle and
Martin Vatshelle},
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Characterization and Recognition of Digraphs of Bounded Kelly-width},
booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
pages = {270--279},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7\_26},
doi = {10.1007/978-3-540-74839-7\_26},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/MeisterTV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/GebremedhinELGT06,
author = {Assefaw Hadish Gebremedhin and
Mohamed Essa{\"{\i}}di and
Isabelle Gu{\'{e}}rin Lassous and
Jens Gustedt and
Jan Arne Telle},
title = {{PRO:} {A} Model for the Design and Analysis of Efficient and Scalable
Parallel Algorithms},
journal = {Nord. J. Comput.},
volume = {13},
number = {4},
pages = {215--239},
year = {2006},
timestamp = {Tue, 29 Jan 2008 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/GebremedhinELGT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/WoodT06,
author = {David R. Wood and
Jan Arne Telle},
editor = {Michael Kaufmann and
Dorothea Wagner},
title = {Planar Decompositions and the Crossing Number of Graphs with an Excluded
Minor},
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 = {150--161},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-70904-6\_16},
doi = {10.1007/978-3-540-70904-6\_16},
timestamp = {Sun, 13 Nov 2022 09:57:32 +0100},
biburl = {https://dblp.org/rec/conf/gd/WoodT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/SloperT06,
author = {Christian Sloper and
Jan Arne Telle},
editor = {Hans L. Bodlaender and
Michael A. Langston},
title = {Towards a Taxonomy of Techniques for Designing Parameterized Algorithms},
booktitle = {Parameterized and Exact Computation, Second International Workshop,
{IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4169},
pages = {251--263},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11847250\_23},
doi = {10.1007/11847250\_23},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/SloperT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/DornT06,
author = {Frederic Dorn and
Jan Arne Telle},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Two Birds with One Stone: The Best of Branchwidth and Treewidth with
One Algorithm},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {386--397},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_37},
doi = {10.1007/11682462\_37},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/DornT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/PaulPT06,
author = {Christophe Paul and
Andrzej Proskurowski and
Jan Arne Telle},
editor = {Fedor V. Fomin},
title = {Generation of Graphs with Bounded Branchwidth},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {205--216},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_19},
doi = {10.1007/11917496\_19},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/PaulPT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominHT04,
author = {Fedor V. Fomin and
Pinar Heggernes and
Jan Arne Telle},
title = {Graph Searching, Elimination Trees, and a Generalization of Bandwidth},
journal = {Algorithmica},
volume = {41},
number = {2},
pages = {73--87},
year = {2005},
url = {https://doi.org/10.1007/s00453-004-1117-y},
doi = {10.1007/S00453-004-1117-Y},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominHT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Telle05,
author = {Jan Arne Telle},
title = {Tree-decompositions of small pathwidth},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {210--218},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.01.012},
doi = {10.1016/J.DAM.2004.01.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Telle05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PaulT05,
author = {Christophe Paul and
Jan Arne Telle},
title = {Edge-maximal graphs of branchwidth k},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {363--368},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.075},
doi = {10.1016/J.ENDM.2005.06.075},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PaulT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HeggernesTV05,
author = {Pinar Heggernes and
Jan Arne Telle and
Yngve Villanger},
title = {Computing Minimal Triangulations in Time \emph{O}(\emph{n}\({}^{\mbox{alpha}}\)
\emph{log n}) = \emph{o}(\emph{n} \({}^{\mbox{2.376}}\))},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {900--913},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445010},
doi = {10.1137/S0895480104445010},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HeggernesTV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PaulT05,
author = {Christophe Paul and
Jan Arne Telle},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {New Tools and Simpler Algorithms for Branchwidth},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {379--390},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_35},
doi = {10.1007/11561071\_35},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/PaulT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FialaPT05,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma and
Jan Arne Telle},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International
Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3618},
pages = {340--351},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_30},
doi = {10.1007/11549345\_30},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FialaPT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HeggernesTV05,
author = {Pinar Heggernes and
Jan Arne Telle and
Yngve Villanger},
title = {Computing minimal triangulations in time O(n\({}^{\mbox{alpha}}\)
log n) = o(n\({}^{\mbox{2.376}}\))},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {907--916},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070560},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/HeggernesTV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FialaPT05,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma and
Jan Arne Telle},
editor = {Dieter Kratsch},
title = {Algorithms for Comparability of Matrices in Partial Orders Imposed
by Graph Homomorphisms},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {115--126},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_11},
doi = {10.1007/11604686\_11},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/FialaPT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HedetniemiHMPT04,
author = {Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Alice A. McRae and
Dee Parks and
Jan Arne Telle},
title = {Iterated colorings of graphs},
journal = {Discret. Math.},
volume = {278},
number = {1-3},
pages = {81--108},
year = {2004},
url = {https://doi.org/10.1016/S0012-365X(03)00247-4},
doi = {10.1016/S0012-365X(03)00247-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HedetniemiHMPT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BodlaenderT04,
author = {Hans L. Bodlaender and
Jan Arne Telle},
title = {Space-Efficient Construction Variants of Dynamic Programming},
journal = {Nord. J. Comput.},
volume = {11},
number = {4},
pages = {374--385},
year = {2004},
timestamp = {Wed, 03 May 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/BodlaenderT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FellowsHRST04,
author = {Mike Fellows and
Pinar Heggernes and
Frances A. Rosamond and
Christian Sloper and
Jan Arne Telle},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {Finding k Disjoint Triangles in an Arbitrary Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {235--244},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_20},
doi = {10.1007/978-3-540-30559-0\_20},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FellowsHRST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GebremedhinLGT03,
author = {Assefaw Hadish Gebremedhin and
Isabelle Gu{\'{e}}rin Lassous and
Jens Gustedt and
Jan Arne Telle},
title = {Graph coloring on coarse grained multicomputers},
journal = {Discret. Appl. Math.},
volume = {131},
number = {1},
pages = {179--198},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00424-9},
doi = {10.1016/S0166-218X(02)00424-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GebremedhinLGT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HalldorssonKPSST03,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Andrzej Proskurowski and
Ravit Salman and
Hadas Shachnai and
Jan Arne Telle},
title = {Multicoloring trees},
journal = {Inf. Comput.},
volume = {180},
number = {2},
pages = {113--129},
year = {2003},
url = {https://doi.org/10.1016/S0890-5401(02)00032-9},
doi = {10.1016/S0890-5401(02)00032-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HalldorssonKPSST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/FialaHKT03,
author = {Jir{\'{\i}} Fiala and
Pinar Heggernes and
Petter Kristiansen and
Jan Arne Telle},
title = {Generalized H-coloring and H-covering of Trees},
journal = {Nord. J. Comput.},
volume = {10},
number = {3},
pages = {206--223},
year = {2003},
timestamp = {Fri, 14 Oct 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/FialaHKT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/FominHT03,
author = {Fedor V. Fomin and
Pinar Heggernes and
Jan Arne Telle},
editor = {Andrzej Lingas and
Bengt J. Nilsson},
title = {Graph Searching, Elimination Trees, and a Generalization of Bandwidth},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium,
{FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2751},
pages = {73--85},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45077-1\_8},
doi = {10.1007/978-3-540-45077-1\_8},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/FominHT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/GustedtT03,
author = {Jens Gustedt and
Jan Arne Telle},
editor = {Carlo Blundo and
Cosimo Laneve},
title = {A Work-Optimal Coarse-Grained {PRAM} Algorithm for Lexicographically
First Maximal Independent Set},
booktitle = {Theoretical Computer Science, 8th Italian Conference, {ICTCS} 2003,
Bertinoro, Italy, October 13-15, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2841},
pages = {125--136},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45208-9\_11},
doi = {10.1007/978-3-540-45208-9\_11},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/GustedtT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GustedtMT02,
author = {Jens Gustedt and
Ole A. M{\ae}hle and
Jan Arne Telle},
editor = {David M. Mount and
Clifford Stein},
title = {The Treewidth of Java Programs},
booktitle = {Algorithm Engineering and Experiments, 4th International Workshop,
{ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2409},
pages = {86--97},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45643-0\_7},
doi = {10.1007/3-540-45643-0\_7},
timestamp = {Mon, 17 Aug 2020 11:36:12 +0200},
biburl = {https://dblp.org/rec/conf/alenex/GustedtMT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hpcs/GebremedhinLGT02,
author = {Assefaw Hadish Gebremedhin and
Isabelle Gu{\'{e}}rin Lassous and
Jens Gustedt and
Jan Arne Telle},
title = {{PRO:} {A} Model for Parallel Resource-Optimal Computation},
booktitle = {16th Annual International Symposium on High Performance Computing
Systems and Applications, {HPCS} 2002, June 16-19, 2002, Moncton,
NB, Canada},
pages = {106--113},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.ieeecomputersociety.org/10.1109/HPCS.2002.10006},
doi = {10.1109/HPCS.2002.10006},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hpcs/GebremedhinLGT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FialaHKT02,
author = {Jir{\'{\i}} Fiala and
Pinar Heggernes and
Petter Kristiansen and
Jan Arne Telle},
editor = {Ludek Kucera},
title = {Generalized H-Coloring and H-Covering of Trees},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {198--210},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_18},
doi = {10.1007/3-540-36379-3\_18},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FialaHKT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Telle01,
author = {Jan Arne Telle},
title = {Tree-decompositions of small pathwidth},
journal = {Electron. Notes Discret. Math.},
volume = {10},
pages = {277--280},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00410-X},
doi = {10.1016/S1571-0653(04)00410-X},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Telle01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlairHT01,
author = {Jean R. S. Blair and
Pinar Heggernes and
Jan Arne Telle},
title = {A practical algorithm for making filled graphs minimal},
journal = {Theor. Comput. Sci.},
volume = {250},
number = {1-2},
pages = {125--141},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(99)00126-7},
doi = {10.1016/S0304-3975(99)00126-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BlairHT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AspvallTP00,
author = {Bengt Aspvall and
Jan Arne Telle and
Andrzej Proskurowski},
title = {Memory Requirements for Table Computations in Partial k-Tree Algorithms},
journal = {Algorithmica},
volume = {27},
number = {3},
pages = {382--394},
year = {2000},
url = {https://doi.org/10.1007/s004530010025},
doi = {10.1007/S004530010025},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AspvallTP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HalldorssonKT00,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
title = {Independent Sets with Domination Constraints},
journal = {Discret. Appl. Math.},
volume = {99},
number = {1-3},
pages = {39--54},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00124-9},
doi = {10.1016/S0166-218X(99)00124-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HalldorssonKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HalldorssonKT00,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
title = {Mod-2 Independence and Domination in Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {355--363},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000272},
doi = {10.1142/S0129054100000272},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/HalldorssonKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KristiansenT00,
author = {Petter Kristiansen and
Jan Arne Telle},
editor = {D. T. Lee and
Shang{-}Hua Teng},
title = {Generalized \emph{H}-Coloring of Graphs},
booktitle = {Algorithms and Computation, 11th International Conference, {ISAAC}
2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1969},
pages = {456--466},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40996-3\_39},
doi = {10.1007/3-540-40996-3\_39},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KristiansenT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GebremedhinLGT00,
author = {Assefaw Hadish Gebremedhin and
Isabelle Gu{\'{e}}rin Lassous and
Jens Gustedt and
Jan Arne Telle},
editor = {Ulrik Brandes and
Dorothea Wagner},
title = {Graph Coloring on a Coarse Grained Multiprocessor},
booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop,
{WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1928},
pages = {184--195},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40064-8\_18},
doi = {10.1007/3-540-40064-8\_18},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GebremedhinLGT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/ProskurowskiT99,
author = {Andrzej Proskurowski and
Jan Arne Telle},
title = {Classes of graphs with restricted interval models},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {3},
number = {4},
pages = {167--176},
year = {1999},
url = {https://doi.org/10.46298/dmtcs.263},
doi = {10.46298/DMTCS.263},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/ProskurowskiT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HalldorssonKPSST99,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Andrzej Proskurowski and
Ravit Salman and
Hadas Shachnai and
Jan Arne Telle},
editor = {Takao Asano and
Hiroshi Imai and
D. T. Lee and
Shin{-}Ichi Nakano and
Takeshi Tokuyama},
title = {Multi-coloring Trees},
booktitle = {Computing and Combinatorics, 5th Annual International Conference,
{COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1627},
pages = {271--280},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48686-0\_27},
doi = {10.1007/3-540-48686-0\_27},
timestamp = {Sat, 30 Sep 2023 09:37:25 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HalldorssonKPSST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HalldorssonKT99,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {Mod-2 Independence and Domination in Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {101--109},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_11},
doi = {10.1007/3-540-46784-X\_11},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/wg/HalldorssonKT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/HeggernesT98,
author = {Pinar Heggernes and
Jan Arne Telle},
title = {Partitioning Graphs into Generalized Dominating Sets},
journal = {Nord. J. Comput.},
volume = {5},
number = {2},
pages = {128--142},
year = {1998},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/HeggernesT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/KratochvilPT98,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Jan Arne Telle},
title = {On the Complexity of Graph Covering Problems},
journal = {Nord. J. Comput.},
volume = {5},
number = {3},
pages = {173--195},
year = {1998},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/KratochvilPT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Telle98,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {Independent Sets with Domination Constraints},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {176--187},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055051},
doi = {10.1007/BFB0055051},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Telle98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BodlaenderGT98,
author = {Hans L. Bodlaender and
Jens Gustedt and
Jan Arne Telle},
editor = {Howard J. Karloff},
title = {Linear-Time Register Allocation for a Fixed Number of Registers},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {574--583},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314994},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/BodlaenderGT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AspvallPT98,
author = {Bengt Aspvall and
Andrzej Proskurowski and
Jan Arne Telle},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Memory Requirements for Table Computations in Partial k-tree Algorithms},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {222--233},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054370},
doi = {10.1007/BFB0054370},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AspvallPT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KratochvilPT97,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Jan Arne Telle},
title = {Covering Regular Graphs},
journal = {J. Comb. Theory {B}},
volume = {71},
number = {1},
pages = {1--16},
year = {1997},
url = {https://doi.org/10.1006/jctb.1996.1743},
doi = {10.1006/JCTB.1996.1743},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KratochvilPT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/TelleP97,
author = {Jan Arne Telle and
Andrzej Proskurowski},
title = {Algorithms for Vertex Partitioning Problems on Partial \emph{k}-Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {529--550},
year = {1997},
url = {https://doi.org/10.1137/S0895480194275825},
doi = {10.1137/S0895480194275825},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/TelleP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KratochvilPT97,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Jan Arne Telle},
editor = {Rolf H. M{\"{o}}hring},
title = {Complexity of Colored Graph Covers I. Colored Directed Multigraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop,
{WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1335},
pages = {242--257},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0024502},
doi = {10.1007/BFB0024502},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KratochvilPT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/LoRTZ96,
author = {Virginia Mary Lo and
Sanjay V. Rajopadhye and
Jan Arne Telle and
Xiaoxiong Zhong},
title = {Parallel Divide and Conquer on Meshes},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {7},
number = {10},
pages = {1049--1058},
year = {1996},
url = {https://doi.org/10.1109/71.539736},
doi = {10.1109/71.539736},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/LoRTZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HenzingerT96,
author = {Monika Rauch Henzinger and
Jan Arne Telle},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Faster Algorithms for the Nonemptiness of Streett Automata and for
Communication Protocol Pruning},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {16--27},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_117},
doi = {10.1007/3-540-61422-2\_117},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/HenzingerT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BlairHT96,
author = {Jean R. S. Blair and
Pinar Heggernes and
Jan Arne Telle},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Making an Arbitrary Filled Graph Minimal by Removing Fill Edges},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {173--184},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_130},
doi = {10.1007/3-540-61422-2\_130},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BlairHT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/Telle94,
author = {Jan Arne Telle},
title = {Complexity of Domination-Type Problems in Graphs},
journal = {Nord. J. Comput.},
volume = {1},
number = {1},
pages = {157--171},
year = {1994},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/Telle94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KratochvilPT94,
author = {Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski and
Jan Arne Telle},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {Complexity of Graph Covering Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {93--105},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_40},
doi = {10.1007/3-540-59071-4\_40},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/KratochvilPT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/TelleP93,
author = {Jan Arne Telle and
Andrzej Proskurowski},
title = {Efficient Sets in Partial \emph{k}-Trees},
journal = {Discret. Appl. Math.},
volume = {44},
number = {1-3},
pages = {109--117},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90226-E},
doi = {10.1016/0166-218X(93)90226-E},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/TelleP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/TelleP93,
author = {Jan Arne Telle and
Andrzej Proskurowski},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Practical Algorithms on Partial k-Trees with an Application to Domination-like
Problems},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {610--621},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_284},
doi = {10.1007/3-540-57155-8\_284},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/TelleP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijpp/LoRGKMNTZ91,
author = {Virginia Mary Lo and
Sanjay V. Rajopadhye and
Samik Gupta and
David Keldsen and
Moataz A. Mohamed and
Bill Nitzberg and
Jan Arne Telle and
Xiaoxiong Zhong},
title = {{OREGAMI:} Tools for mapping parallel computations to parallel architectures},
journal = {Int. J. Parallel Program.},
volume = {20},
number = {3},
pages = {237--270},
year = {1991},
url = {https://doi.org/10.1007/BF01379319},
doi = {10.1007/BF01379319},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijpp/LoRGKMNTZ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/LoRGKMT90,
author = {Virginia Mary Lo and
Sanjay V. Rajopadhye and
Samik Gupta and
David Keldsen and
Moataz A. Mohamed and
Jan Arne Telle},
editor = {David A. Padua},
title = {{OREGAMI:} Software Tools for Mapping Parallel Computations to Parallel
Architectures},
booktitle = {Proceedings of the 1990 International Conference on Parallel Processing,
Urbana-Champaign, IL, USA, August 1990. Volume 2: Software},
pages = {88--92},
publisher = {Pennsylvania State University Press},
year = {1990},
timestamp = {Mon, 15 Jun 2015 19:00:07 +0200},
biburl = {https://dblp.org/rec/conf/icpp/LoRGKMT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/LoRGKMT90a,
author = {Virginia Mary Lo and
Sanjay V. Rajopadhye and
Samik Gupta and
David Keldsen and
Moataz A. Mohamed and
Jan Arne Telle},
editor = {Pen{-}Chung Yew},
title = {Mapping Divide-and-Conquer Algorithms to Parallel Architectures},
booktitle = {Proceedings of the 1990 International Conference on Parallel Processing,
Urbana-Champaign, IL, USA, August 1990. Volume 3: Algorithms and Applications},
pages = {128--135},
publisher = {Pennsylvania State University Press},
year = {1990},
timestamp = {Mon, 15 Jun 2015 19:00:07 +0200},
biburl = {https://dblp.org/rec/conf/icpp/LoRGKMT90a.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.
last updated on 2024-09-18 01:11 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:
