Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Lauri, Juho
208  Ergebnisse:
Personensuche X
?
1

Learning fine-grained search space pruning and heuristics f..:

Lauri, Juho ; Dutta, Sourav ; Grassia, Marco.
Journal of Heuristics.  29 (2023)  2-3 - p. 313-347 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Upper bounding rainbow connection number by forest number:

Sunil Chandran, L. ; Issac, Davis ; Lauri, Juho.
Discrete Mathematics.  345 (2022)  7 - p. 112829 , 2022
Link: https://doi.org/10.1016/..
 
?
3

Perfect Italian domination on planar and regular graphs:

Lauri, Juho ; Mitillos, Christodoulos
Discrete Applied Mathematics.  285 (2020)  - p. 676-687 , 2020
Link: https://doi.org/10.1016/..
 
?
4

Parameterized complexity of happy coloring problems:

Agrawal, Akanksha ; Aravind, N.R. ; Kalyanasundaram, Subrahmanyam...
Theoretical Computer Science.  835 (2020)  - p. 58-81 , 2020
Link: https://doi.org/10.1016/..
 
?
5

Complexity of Fall Coloring for Restricted Graph Classes:

Lauri, Juho ; Mitillos, Christodoulos
Theory of Computing Systems.  64 (2020)  7 - p. 1183-1196 , 2020
Link: https://doi.org/10.1007/..
 
?
6

NP-completeness results for partitioning a graph into total..:

Koivisto, Mikko ; Laakkonen, Petteri ; Lauri, Juho
Theoretical Computer Science.  818 (2020)  - p. 22-31 , 2020
Link: https://doi.org/10.1016/..
 
?
7

Finding a Maximum Clique in Dense Graphs via χ2 Statistics:

, In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management,
Dutta, Sourav ; Lauri, Juho - p. 2421-2424 , 2019
Link: https://dl.acm.org/doi/1..
 
?
8

Complexity of Fall Coloring for Restricted Graph Classes:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Lauri, Juho ; Mitillos, Christodoulos - p. 352-364 , 2019
Link: https://doi.org/10.1007/..
 
?
9

On the complexity of rainbow coloring problems:

Eiben, Eduard ; Ganian, Robert ; Lauri, Juho
Discrete Applied Mathematics.  246 (2018)  - p. 38-48 , 2018
Link: https://doi.org/10.1016/..
 
?
10

On the complexity of restoring corrupted colorings:

De Biasi, Marzio ; Lauri, Juho
Journal of Combinatorial Optimization.  37 (2018)  4 - p. 1150-1169 , 2018
Link: https://doi.org/10.1007/..
 
?
11

On the Fine-Grained Complexity of Rainbow Coloring:

Kowalik, Łukasz ; Lauri, Juho ; Socała, Arkadiusz
SIAM Journal on Discrete Mathematics.  32 (2018)  3 - p. 1672-1705 , 2018
Link: https://doi.org/10.1137/..
 
?
12

Complexity of rainbow vertex connectivity problems for rest..:

Lauri, Juho
Discrete Applied Mathematics.  219 (2017)  - p. 132-146 , 2017
Link: https://doi.org/10.1016/..
 
?
13

Further hardness results on rainbow and strong rainbow conn..:

Lauri, Juho
Discrete Applied Mathematics.  201 (2016)  - p. 191-200 , 2016
Link: https://doi.org/10.1016/..
 
?
14

On finding rainbow and colorful paths:

Kowalik, Łukasz ; Lauri, Juho
Theoretical Computer Science.  628 (2016)  - p. 110-114 , 2016
Link: https://doi.org/10.1016/..
 
?
15

NP-completeness results for partitioning a graph into total..:

Koivisto, Mikko ; Laakkonen, Petteri ; Lauri, Juho
10.1016/j.tcs.2018.04.006.  , 2022
Link: http://hdl.handle.net/10..
 
1-15