default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Juho Lauri
@article{DBLP:journals/heuristics/Lauri0GA23,
author = {Juho Lauri and
Sourav Dutta and
Marco Grassia and
Deepak Ajwani},
title = {Learning fine-grained search space pruning and heuristics for combinatorial
optimization},
journal = {J. Heuristics},
volume = {29},
number = {2-3},
pages = {313--347},
year = {2023},
url = {https://doi.org/10.1007/s10732-023-09512-z},
doi = {10.1007/S10732-023-09512-Z},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/heuristics/Lauri0GA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChandranILL22,
author = {L. Sunil Chandran and
Davis Issac and
Juho Lauri and
Erik Jan van Leeuwen},
title = {Upper bounding rainbow connection number by forest number},
journal = {Discret. Math.},
volume = {345},
number = {7},
pages = {112829},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.112829},
doi = {10.1016/J.DISC.2022.112829},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ChandranILL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-05255,
author = {James Cumberbatch and
Juho Lauri and
Christodoulos Mitillos},
title = {Exact defective colorings of graphs},
journal = {CoRR},
volume = {abs/2109.05255},
year = {2021},
url = {https://arxiv.org/abs/2109.05255},
eprinttype = {arXiv},
eprint = {2109.05255},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-05255.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bigdata/ThejaswiGL20,
author = {Suhas Thejaswi and
Aristides Gionis and
Juho Lauri},
title = {Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints},
journal = {Big Data},
volume = {8},
number = {5},
pages = {335--362},
year = {2020},
url = {https://doi.org/10.1089/big.2020.0078},
doi = {10.1089/BIG.2020.0078},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bigdata/ThejaswiGL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LauriM20,
author = {Juho Lauri and
Christodoulos Mitillos},
title = {Perfect Italian domination on planar and regular graphs},
journal = {Discret. Appl. Math.},
volume = {285},
pages = {676--687},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.05.024},
doi = {10.1016/J.DAM.2020.05.024},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LauriM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LauriM20,
author = {Juho Lauri and
Christodoulos Mitillos},
title = {Complexity of Fall Coloring for Restricted Graph Classes},
journal = {Theory Comput. Syst.},
volume = {64},
number = {7},
pages = {1183--1196},
year = {2020},
url = {https://doi.org/10.1007/s00224-020-09982-9},
doi = {10.1007/S00224-020-09982-9},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/LauriM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KoivistoLL20,
author = {Mikko Koivisto and
Petteri Laakkonen and
Juho Lauri},
title = {NP-completeness results for partitioning a graph into total dominating
sets},
journal = {Theor. Comput. Sci.},
volume = {818},
pages = {22--31},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2018.04.006},
doi = {10.1016/J.TCS.2018.04.006},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KoivistoLL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AgrawalAKKLMR20,
author = {Akanksha Agrawal and
N. R. Aravind and
Subrahmanyam Kalyanasundaram and
Anjeneya Swami Kare and
Juho Lauri and
Neeldhara Misra and
I. Vinod Reddy},
title = {Parameterized complexity of happy coloring problems},
journal = {Theor. Comput. Sci.},
volume = {835},
pages = {58--81},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.06.002},
doi = {10.1016/J.TCS.2020.06.002},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AgrawalAKKLMR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icwsm/GurukarA0L0S20,
author = {Saket Gurukar and
Deepak Ajwani and
Sourav Dutta and
Juho Lauri and
Srinivasan Parthasarathy and
Alessandra Sala},
editor = {Munmun De Choudhury and
Rumi Chunara and
Aron Culotta and
Brooke Foucault Welles},
title = {Towards Quantifying the Distance between Opinions},
booktitle = {Proceedings of the Fourteenth International {AAAI} Conference on Web
and Social Media, {ICWSM} 2020, Held Virtually, Original Venue: Atlanta,
Georgia, USA, June 8-11, 2020},
pages = {229--239},
publisher = {{AAAI} Press},
year = {2020},
url = {https://ojs.aaai.org/index.php/ICWSM/article/view/7294},
timestamp = {Mon, 07 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icwsm/GurukarA0L0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-01230,
author = {Juho Lauri and
Sourav Dutta and
Marco Grassia and
Deepak Ajwani},
title = {Learning fine-grained search space pruning and heuristics for combinatorial
optimization},
journal = {CoRR},
volume = {abs/2001.01230},
year = {2020},
url = {http://arxiv.org/abs/2001.01230},
eprinttype = {arXiv},
eprint = {2001.01230},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-01230.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-09879,
author = {Saket Gurukar and
Deepak Ajwani and
Sourav Dutta and
Juho Lauri and
Srinivasan Parthasarathy and
Alessandra Sala},
title = {Towards Quantifying the Distance between Opinions},
journal = {CoRR},
volume = {abs/2001.09879},
year = {2020},
url = {https://arxiv.org/abs/2001.09879},
eprinttype = {arXiv},
eprint = {2001.09879},
timestamp = {Thu, 30 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-09879.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BiasiL19,
author = {Marzio De Biasi and
Juho Lauri},
title = {On the complexity of restoring corrupted colorings},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1150--1169},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0342-2},
doi = {10.1007/S10878-018-0342-2},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BiasiL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/LauriD19,
author = {Juho Lauri and
Sourav Dutta},
title = {Fine-Grained Search Space Classification for Hard Enumeration Variants
of Subset Problems},
booktitle = {The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI}
2019, The Thirty-First Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2019, Honolulu, Hawaii,
USA, January 27 - February 1, 2019},
pages = {2314--2321},
publisher = {{AAAI} Press},
year = {2019},
url = {https://doi.org/10.1609/aaai.v33i01.33012314},
doi = {10.1609/AAAI.V33I01.33012314},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/LauriD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/DuttaL19,
author = {Sourav Dutta and
Juho Lauri},
editor = {Wenwu Zhu and
Dacheng Tao and
Xueqi Cheng and
Peng Cui and
Elke A. Rundensteiner and
David Carmel and
Qi He and
Jeffrey Xu Yu},
title = {Finding a Maximum Clique in Dense Graphs via {\(\chi\)}2 Statistics},
booktitle = {Proceedings of the 28th {ACM} International Conference on Information
and Knowledge Management, {CIKM} 2019, Beijing, China, November 3-7,
2019},
pages = {2421--2424},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3357384.3358126},
doi = {10.1145/3357384.3358126},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cikm/DuttaL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/LauriM19,
author = {Juho Lauri and
Christodoulos Mitillos},
editor = {Charles J. Colbourn and
Roberto Grossi and
Nadia Pisanti},
title = {Complexity of Fall Coloring for Restricted Graph Classes},
booktitle = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
Pisa, Italy, July 23-25, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11638},
pages = {352--364},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25005-8\_29},
doi = {10.1007/978-3-030-25005-8\_29},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/LauriM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08455,
author = {Juho Lauri and
Sourav Dutta},
title = {Fine-grained Search Space Classification for Hard Enumeration Variants
of Subset Problems},
journal = {CoRR},
volume = {abs/1902.08455},
year = {2019},
url = {http://arxiv.org/abs/1902.08455},
eprinttype = {arXiv},
eprint = {1902.08455},
timestamp = {Thu, 21 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-08455.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-04695,
author = {Juho Lauri and
Christodoulos Mitillos},
title = {Complexity of fall coloring for restricted graph classes},
journal = {CoRR},
volume = {abs/1905.04695},
year = {2019},
url = {http://arxiv.org/abs/1905.04695},
eprinttype = {arXiv},
eprint = {1905.04695},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-04695.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-06293,
author = {Juho Lauri and
Christodoulos Mitillos},
title = {Perfect Italian domination on planar and regular graphs},
journal = {CoRR},
volume = {abs/1905.06293},
year = {2019},
url = {http://arxiv.org/abs/1905.06293},
eprinttype = {arXiv},
eprint = {1905.06293},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-06293.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00517,
author = {Marco Grassia and
Juho Lauri and
Sourav Dutta and
Deepak Ajwani},
title = {Learning Multi-Stage Sparsification for Maximum Clique Enumeration},
journal = {CoRR},
volume = {abs/1910.00517},
year = {2019},
url = {http://arxiv.org/abs/1910.00517},
eprinttype = {arXiv},
eprint = {1910.00517},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-00517.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EibenGL18,
author = {Eduard Eiben and
Robert Ganian and
Juho Lauri},
title = {On the complexity of rainbow coloring problems},
journal = {Discret. Appl. Math.},
volume = {246},
pages = {38--48},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2016.10.021},
doi = {10.1016/J.DAM.2016.10.021},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EibenGL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/KeranenL18,
author = {Melissa S. Keranen and
Juho Lauri},
title = {Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {20},
number = {1},
year = {2018},
url = {https://doi.org/10.23638/DMTCS-20-1-22},
doi = {10.23638/DMTCS-20-1-22},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/KeranenL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KowalikLS18,
author = {Lukasz Kowalik and
Juho Lauri and
Arkadiusz Socala},
title = {On the Fine-Grained Complexity of Rainbow Coloring},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {1672--1705},
year = {2018},
url = {https://doi.org/10.1137/16M1102690},
doi = {10.1137/16M1102690},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/KowalikLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HeggernesILLL18,
author = {Pinar Heggernes and
Davis Issac and
Juho Lauri and
Paloma T. Lima and
Erik Jan van Leeuwen},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {83:1--83:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.83},
doi = {10.4230/LIPICS.MFCS.2018.83},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HeggernesILLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/KaskiLT18,
author = {Petteri Kaski and
Juho Lauri and
Suhas Thejaswi},
editor = {Gianlorenzo D'Angelo},
title = {Engineering Motif Search for Large Motifs},
booktitle = {17th International Symposium on Experimental Algorithms, {SEA} 2018,
June 27-29, 2018, L'Aquila, Italy},
series = {LIPIcs},
volume = {103},
pages = {28:1--28:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SEA.2018.28},
doi = {10.4230/LIPICS.SEA.2018.28},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/wea/KaskiLT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lauri17,
author = {Juho Lauri},
title = {Complexity of rainbow vertex connectivity problems for restricted
graph classes},
journal = {Discret. Appl. Math.},
volume = {219},
pages = {132--146},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.11.023},
doi = {10.1016/J.DAM.2016.11.023},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Lauri17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KoivistoLL17,
author = {Mikko Koivisto and
Petteri Laakkonen and
Juho Lauri},
editor = {Yixin Cao and
Jianer Chen},
title = {NP-completeness Results for Partitioning a Graph into Total Dominating
Sets},
booktitle = {Computing and Combinatorics - 23rd International Conference, {COCOON}
2017, Hong Kong, China, August 3-5, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10392},
pages = {333--345},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62389-4\_28},
doi = {10.1007/978-3-319-62389-4\_28},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/KoivistoLL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiasiL17,
author = {Marzio De Biasi and
Juho Lauri},
title = {On the Complexity of Restoring Corrupted Colorings},
journal = {CoRR},
volume = {abs/1701.01939},
year = {2017},
url = {http://arxiv.org/abs/1701.01939},
eprinttype = {arXiv},
eprint = {1701.01939},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiasiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AravindKKL17,
author = {N. R. Aravind and
Subrahmanyam Kalyanasundaram and
Anjeneya Swami Kare and
Juho Lauri},
title = {Algorithms and hardness results for happy coloring problems},
journal = {CoRR},
volume = {abs/1705.08282},
year = {2017},
url = {http://arxiv.org/abs/1705.08282},
eprinttype = {arXiv},
eprint = {1705.08282},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AravindKKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lauri16,
author = {Juho Lauri},
title = {Further hardness results on rainbow and strong rainbow connectivity},
journal = {Discret. Appl. Math.},
volume = {201},
pages = {191--200},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.07.041},
doi = {10.1016/J.DAM.2015.07.041},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Lauri16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KowalikL16,
author = {Lukasz Kowalik and
Juho Lauri},
title = {On finding rainbow and colorful paths},
journal = {Theor. Comput. Sci.},
volume = {628},
pages = {110--114},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.03.017},
doi = {10.1016/J.TCS.2016.03.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KowalikL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KowalikLS16,
author = {Lukasz Kowalik and
Juho Lauri and
Arkadiusz Socala},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {On the Fine-Grained Complexity of Rainbow Coloring},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {58:1--58:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.58},
doi = {10.4230/LIPICS.ESA.2016.58},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KowalikLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KowalikLS16,
author = {Lukasz Kowalik and
Juho Lauri and
Arkadiusz Socala},
title = {On the fine-grained complexity of rainbow coloring},
journal = {CoRR},
volume = {abs/1602.05608},
year = {2016},
url = {http://arxiv.org/abs/1602.05608},
eprinttype = {arXiv},
eprint = {1602.05608},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KowalikLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Lauri16,
author = {Juho Lauri},
title = {Complexity of Rainbow Vertex Connectivity Problems for Restricted
Graph Classes},
journal = {CoRR},
volume = {abs/1612.07768},
year = {2016},
url = {http://arxiv.org/abs/1612.07768},
eprinttype = {arXiv},
eprint = {1612.07768},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Lauri16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BjorklundKKL15,
author = {Andreas Bj{\"{o}}rklund and
Petteri Kaski and
Lukasz Kowalik and
Juho Lauri},
editor = {Ulrik Brandes and
David Eppstein},
title = {Engineering Motif Search for Large Graphs},
booktitle = {Proceedings of the Seventeenth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2015, San Diego, CA, USA, January 5, 2015},
pages = {104--118},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973754.10},
doi = {10.1137/1.9781611973754.10},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/BjorklundKKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/EibenGL15,
author = {Eduard Eiben and
Robert Ganian and
Juho Lauri},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {On the Complexity of Rainbow Coloring Problems},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {209--220},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_18},
doi = {10.1007/978-3-319-29516-9\_18},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/EibenGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EibenGL15,
author = {Eduard Eiben and
Robert Ganian and
Juho Lauri},
title = {On the Complexity of Rainbow Coloring Problems},
journal = {CoRR},
volume = {abs/1510.03614},
year = {2015},
url = {http://arxiv.org/abs/1510.03614},
eprinttype = {arXiv},
eprint = {1510.03614},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EibenGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Lauri14,
author = {Juho Lauri},
title = {Further Hardness Results on Rainbow and Strong Rainbow Connectivity},
journal = {CoRR},
volume = {abs/1404.3082},
year = {2014},
url = {http://arxiv.org/abs/1404.3082},
eprinttype = {arXiv},
eprint = {1404.3082},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Lauri14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LauriK14,
author = {Juho Lauri and
Melissa S. Keranen},
title = {Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs},
journal = {CoRR},
volume = {abs/1405.6893},
year = {2014},
url = {http://arxiv.org/abs/1405.6893},
eprinttype = {arXiv},
eprint = {1405.6893},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LauriK14.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-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
