Juho Lauri

Cited by

	All	Since 2019
Citations	308	245
h-index	12	9
i10-index	14	9

20152016201720182019202020212022202320242 4 24 27 30 24 35 63 29 60

Public access

View all

8 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Sourav DuttaHuawei Research. Dublin, Ireland.Verified email at huawei.com
Lukasz KowalikUniversity of WarsawVerified email at mimuw.edu.pl
Deepak AjwaniUniversity College DublinVerified email at ucd.ie
Suhas ThejaswiMax Planck Institute for Software SystemsVerified email at mpi-sws.org
Aristides GionisKTH Royal Institute of Technology, and Aalto UniversityVerified email at kth.se
Marco GrassiaUniversity of CataniaVerified email at unict.it
Anjeneya Swami KareUniversity of HyderabadVerified email at uohyd.ac.in
N.R. AravindIndian Institute of Technology HyderabadVerified email at iith.ac.in
Subrahmanyam KalyanasundaramIIT HyderabadVerified email at iith.ac.in
Petteri KaskiAssistant Professor of Computer Science, Aalto UniversityVerified email at aalto.fi
Erik Jan van LeeuwenUtrecht University, The NetherlandsVerified email at uu.nl
Davis IssacHasso Plattner Institute, Potsdam, GermanyVerified email at hpi.de
Melissa KeranenDepartment of Mathematical Sciences, Michigan Technological UniversityVerified email at mtu.edu
Robert GanianTU WienVerified email at ac.tuwien.ac.at
Eduard EibenLecturer in Computer Science, Royal Holloway, Univeristy of LondonVerified email at rhul.ac.uk
Andreas BjörklundVerified email at itu.dk
Arkadiusz SocałaUniversity of WarsawVerified email at mimuw.edu.pl
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Paloma T. de LimaIT University of CopenhagenVerified email at itu.dk
Mikko KoivistoProfessor, University of HelsinkiVerified email at helsinki.fi

Juho Lauri

OP Financial Group

Verified email at op.fi - Homepage

algorithms graph theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Fine-grained search space classification for hard enumeration variants of subset problems J Lauri, S Dutta Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2314-2321, 2019	32	2019
On finding rainbow and colorful paths Ł Kowalik, J Lauri Theoretical Computer Science 628, 110-114, 2016	23	2016
Learning fine-grained search space pruning and heuristics for combinatorial optimization J Lauri, S Dutta, M Grassia, D Ajwani Journal of Heuristics 29 (2), 313-347, 2023	21	2023
On the complexity of rainbow coloring problems E Eiben, R Ganian, J Lauri Discrete Applied Mathematics 246, 38-48, 2018	20	2018
Algorithms and hardness results for happy coloring problems NR Aravind, S Kalyanasundaram, AS Kare, J Lauri arXiv preprint arXiv:1705.08282, 2017	20	2017
Further hardness results on rainbow and strong rainbow connectivity J Lauri Discrete Applied Mathematics 201, 191-200, 2016	19	2016
Engineering motif search for large graphs A Björklund, P Kaski, L Kowalik, J Lauri 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and …, 2014	17	2014
Perfect Italian domination on planar and regular graphs J Lauri, C Mitillos Discrete Applied Mathematics 285, 676-687, 2020	16	2020
On the fine-grained complexity of rainbow coloring Ł Kowalik, J Lauri, A Socała SIAM Journal on Discrete Mathematics 32 (3), 1672-1705, 2018	16	2018
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs P Heggernes, D Issac, J Lauri, PT Lima, EJ van Leeuwen 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018	16	2018
Learning Multi-Stage Sparsification for Maximum Clique Enumeration M Grassia, J Lauri, S Dutta, D Ajwani arXiv preprint arXiv:1910.00517, 2019	15	2019
NP-completeness results for partitioning a graph into total dominating sets M Koivisto, P Laakkonen, J Lauri Theoretical Computer Science 818, 22-31, 2020	13	2020
Computing minimum rainbow and strong rainbow colorings of block graphs M Keranen, J Lauri Discrete Mathematics & Theoretical Computer Science 20, 2018	11	2018
Chasing the rainbow connection: Hardness, algorithms, and bounds J Lauri Tampere University of Technology. Publication 1428, 2016	11	2016
Finding a Maximum Clique in Dense Graphs via χ2 Statistics S Dutta, J Lauri Proceedings of the 28th ACM International Conference on Information and …, 2019	9	2019
Parameterized complexity of happy coloring problems A Agrawal, NR Aravind, S Kalyanasundaram, AS Kare, J Lauri, N Misra, ... Theoretical Computer Science 835, 58-81, 2020	8	2020
Complexity of fall coloring for restricted graph classes J Lauri, C Mitillos Theory of Computing Systems 64 (7), 1183-1196, 2020	7	2020
Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints S Thejaswi, A Gionis, J Lauri Big Data 8 (5), 335-362, 2020	6	2020
Restless reachability problems in temporal graphs S Thejaswi, J Lauri, A Gionis arXiv e-prints, arXiv: 2010.08423, 2020	5	2020
Towards Quantifying the Distance between Opinions S Gurukar, D Ajwani, S Dutta, J Lauri, S Parthasarathy, A Sala Proceedings of the International AAAI Conference on Web and Social Media 14 …, 2020	5	2020

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors