Sledovat
Juho Lauri
Juho Lauri
OP Financial Group
E-mailová adresa ověřena na: op.fi - Domovská stránka
Název
Citace
Citace
Rok
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
332019
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
252023
On finding rainbow and colorful paths
Ł Kowalik, J Lauri
Theoretical Computer Science 628, 110-114, 2016
232016
On the complexity of rainbow coloring problems
E Eiben, R Ganian, J Lauri
Discrete Applied Mathematics 246, 38-48, 2018
202018
Algorithms and hardness results for happy coloring problems
NR Aravind, S Kalyanasundaram, AS Kare, J Lauri
arXiv preprint arXiv:1705.08282, 2017
202017
Further hardness results on rainbow and strong rainbow connectivity
J Lauri
Discrete Applied Mathematics 201, 191-200, 2016
192016
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
182018
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
172014
On the fine-grained complexity of rainbow coloring
Ł Kowalik, J Lauri, A Socała
SIAM Journal on Discrete Mathematics 32 (3), 1672-1705, 2018
162018
Perfect Italian domination on planar and regular graphs
J Lauri, C Mitillos
Discrete Applied Mathematics 285, 676-687, 2020
152020
Learning Multi-Stage Sparsification for Maximum Clique Enumeration
M Grassia, J Lauri, S Dutta, D Ajwani
arXiv preprint arXiv:1910.00517, 2019
152019
NP-completeness results for partitioning a graph into total dominating sets
M Koivisto, P Laakkonen, J Lauri
Theoretical Computer Science 818, 22-31, 2020
142020
Chasing the rainbow connection: Hardness, algorithms, and bounds
J Lauri
Tampere University of Technology. Publication 1428, 2016
122016
Computing minimum rainbow and strong rainbow colorings of block graphs
M Keranen, J Lauri
Discrete Mathematics & Theoretical Computer Science 20, 2018
112018
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
92019
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
82020
Complexity of fall coloring for restricted graph classes
J Lauri, C Mitillos
Theory of Computing Systems 64 (7), 1183-1196, 2020
72020
Restless reachability problems in temporal graphs
S Thejaswi, J Lauri, A Gionis
arXiv e-prints, arXiv: 2010.08423, 2020
62020
Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints
S Thejaswi, A Gionis, J Lauri
Big Data 8 (5), 335-362, 2020
62020
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
52020
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20