default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuho Lauri
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Juho Lauri, Sourav Dutta
, Marco Grassia, Deepak Ajwani:
Learning fine-grained search space pruning and heuristics for combinatorial optimization. J. Heuristics 29(2-3): 313-347 (2023)- 2022
- [j13]L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen:
Upper bounding rainbow connection number by forest number. Discret. Math. 345(7): 112829 (2022) - 2021
- [i14]James Cumberbatch, Juho Lauri, Christodoulos Mitillos:
Exact defective colorings of graphs. CoRR abs/2109.05255 (2021) - 2020
- [j12]Suhas Thejaswi, Aristides Gionis, Juho Lauri:
Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints. Big Data 8(5): 335-362 (2020) - [j11]Juho Lauri, Christodoulos Mitillos:
Perfect Italian domination on planar and regular graphs. Discret. Appl. Math. 285: 676-687 (2020) - [j10]Juho Lauri, Christodoulos Mitillos:
Complexity of Fall Coloring for Restricted Graph Classes. Theory Comput. Syst. 64(7): 1183-1196 (2020) - [j9]Mikko Koivisto, Petteri Laakkonen, Juho Lauri:
NP-completeness results for partitioning a graph into total dominating sets. Theor. Comput. Sci. 818: 22-31 (2020) - [j8]Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy:
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835: 58-81 (2020) - [c10]Saket Gurukar, Deepak Ajwani, Sourav Dutta, Juho Lauri, Srinivasan Parthasarathy, Alessandra Sala:
Towards Quantifying the Distance between Opinions. ICWSM 2020: 229-239 - [i13]Juho Lauri, Sourav Dutta, Marco Grassia, Deepak Ajwani:
Learning fine-grained search space pruning and heuristics for combinatorial optimization. CoRR abs/2001.01230 (2020) - [i12]Saket Gurukar, Deepak Ajwani, Sourav Dutta, Juho Lauri, Srinivasan Parthasarathy, Alessandra Sala:
Towards Quantifying the Distance between Opinions. CoRR abs/2001.09879 (2020)
2010 – 2019
- 2019
- [j7]Marzio De Biasi, Juho Lauri:
On the complexity of restoring corrupted colorings. J. Comb. Optim. 37(4): 1150-1169 (2019) - [c9]Juho Lauri, Sourav Dutta:
Fine-Grained Search Space Classification for Hard Enumeration Variants of Subset Problems. AAAI 2019: 2314-2321 - [c8]Sourav Dutta, Juho Lauri:
Finding a Maximum Clique in Dense Graphs via χ2 Statistics. CIKM 2019: 2421-2424 - [c7]Juho Lauri, Christodoulos Mitillos:
Complexity of Fall Coloring for Restricted Graph Classes. IWOCA 2019: 352-364 - [i11]Juho Lauri, Sourav Dutta:
Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems. CoRR abs/1902.08455 (2019) - [i10]Juho Lauri, Christodoulos Mitillos:
Complexity of fall coloring for restricted graph classes. CoRR abs/1905.04695 (2019) - [i9]Juho Lauri, Christodoulos Mitillos:
Perfect Italian domination on planar and regular graphs. CoRR abs/1905.06293 (2019) - [i8]Marco Grassia, Juho Lauri, Sourav Dutta, Deepak Ajwani:
Learning Multi-Stage Sparsification for Maximum Clique Enumeration. CoRR abs/1910.00517 (2019) - 2018
- [j6]Eduard Eiben, Robert Ganian, Juho Lauri:
On the complexity of rainbow coloring problems. Discret. Appl. Math. 246: 38-48 (2018) - [j5]Melissa S. Keranen, Juho Lauri:
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j4]Lukasz Kowalik, Juho Lauri, Arkadiusz Socala:
On the Fine-Grained Complexity of Rainbow Coloring. SIAM J. Discret. Math. 32(3): 1672-1705 (2018) - [c6]Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen:
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS 2018: 83:1-83:13 - [c5]Petteri Kaski, Juho Lauri, Suhas Thejaswi:
Engineering Motif Search for Large Motifs. SEA 2018: 28:1-28:19 - 2017
- [j3]Juho Lauri:
Complexity of rainbow vertex connectivity problems for restricted graph classes. Discret. Appl. Math. 219: 132-146 (2017) - [c4]Mikko Koivisto, Petteri Laakkonen, Juho Lauri:
NP-completeness Results for Partitioning a Graph into Total Dominating Sets. COCOON 2017: 333-345 - [i7]Marzio De Biasi, Juho Lauri:
On the Complexity of Restoring Corrupted Colorings. CoRR abs/1701.01939 (2017) - [i6]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri:
Algorithms and hardness results for happy coloring problems. CoRR abs/1705.08282 (2017) - 2016
- [j2]Juho Lauri:
Further hardness results on rainbow and strong rainbow connectivity. Discret. Appl. Math. 201: 191-200 (2016) - [j1]Lukasz Kowalik, Juho Lauri:
On finding rainbow and colorful paths. Theor. Comput. Sci. 628: 110-114 (2016) - [c3]Lukasz Kowalik, Juho Lauri, Arkadiusz Socala:
On the Fine-Grained Complexity of Rainbow Coloring. ESA 2016: 58:1-58:16 - [i5]Lukasz Kowalik, Juho Lauri, Arkadiusz Socala:
On the fine-grained complexity of rainbow coloring. CoRR abs/1602.05608 (2016) - [i4]Juho Lauri:
Complexity of Rainbow Vertex Connectivity Problems for Restricted Graph Classes. CoRR abs/1612.07768 (2016) - 2015
- [c2]Andreas Björklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri:
Engineering Motif Search for Large Graphs. ALENEX 2015: 104-118 - [c1]Eduard Eiben, Robert Ganian, Juho Lauri:
On the Complexity of Rainbow Coloring Problems. IWOCA 2015: 209-220 - [i3]Eduard Eiben, Robert Ganian, Juho Lauri:
On the Complexity of Rainbow Coloring Problems. CoRR abs/1510.03614 (2015) - 2014
- [i2]Juho Lauri:
Further Hardness Results on Rainbow and Strong Rainbow Connectivity. CoRR abs/1404.3082 (2014) - [i1]Juho Lauri, Melissa S. Keranen:
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs. CoRR abs/1405.6893 (2014)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
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:
