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

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..
 
?
2

Exact defective colorings of graphs:

Cumberbatch, James ; Lauri, Juho ; Mitillos, Christodoulos
http://arxiv.org/abs/2109.05255.  , 2021
Link: http://arxiv.org/abs/210..
 
?
3

Restless reachability problems in temporal graphs:

Thejaswi, Suhas ; Lauri, Juho ; Gionis, Aristides
http://arxiv.org/abs/2010.08423.  , 2020
Link: http://arxiv.org/abs/201..
 
?
4

Finding Path Motifs in Large Temporal Graphs Using Algebrai..:

Thejaswi, Suhas ; Gionis, Aristides ; Lauri, Juho
info:eu-repo/grantAgreement/EC/H2020/871042/EU//SoBigData-PlusPlus.  , 2020
Link: https://aaltodoc.aalto.f..
 
?
5

Finding path motifs in large temporal graphs using algebrai..:

Thejaswi, Suhas ; Gionis, Aristides ; Lauri, Juho
http://arxiv.org/abs/2001.07158.  , 2020
Link: http://arxiv.org/abs/200..
 
?
6

Upper Bounding Rainbow Connection Number by Forest Number:

Chandran, L. Sunil ; Issac, Davis ; Lauri, Juho.
http://arxiv.org/abs/2006.06551.  , 2020
Link: http://arxiv.org/abs/200..
 
?
7

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

Lauri, Juho ; Dutta, Sourav ; Grassia, Marco.
http://arxiv.org/abs/2001.01230.  , 2020
Link: http://arxiv.org/abs/200..
 
?
8

Towards Quantifying the Distance between Opinions:

Gurukar, Saket ; Ajwani, Deepak ; Dutta, Sourav...
http://arxiv.org/abs/2001.09879.  , 2020
Link: http://arxiv.org/abs/200..
 
?
9

Perfect Italian domination on planar and regular graphs:

Lauri, Juho ; Mitillos, Christodoulos
http://arxiv.org/abs/1905.06293.  , 2019
Link: http://arxiv.org/abs/190..
 
?
10

NP-completeness Results for Partitioning a Graph into Total..:

Koivisto, Mikko ; Laakkonen, Petteri ; Lauri, Juho
10.1007/978-3-319-62389-4_28.  , 2019
Link: http://hdl.handle.net/10..
 
?
11

Learning Multi-Stage Sparsification for Maximum Clique Enum..:

Grassia, Marco ; Lauri, Juho ; Dutta, Sourav.
http://arxiv.org/abs/1910.00517.  , 2019
Link: http://arxiv.org/abs/191..
 
?
12

Fine-grained Search Space Classification for Hard Enumerati..:

Lauri, Juho ; Dutta, Sourav
http://arxiv.org/abs/1902.08455.  , 2019
Link: http://arxiv.org/abs/190..
 
?
13

Complexity of fall coloring for restricted graph classes:

Lauri, Juho ; Mitillos, Christodoulos
http://arxiv.org/abs/1905.04695.  , 2019
Link: http://arxiv.org/abs/190..
 
?
14

Engineering Motif Search for Large Motifs:

Kaski, Petteri ; Lauri, Juho ; Muniyappa, Suhas
International Symposium on Experimental Algorithms.  , 2018
Link: https://aaltodoc.aalto.f..
 
?
15

Engineering Motif Search for Large Motifs:

Kaski, Petteri ; Lauri, Juho ; Thejaswi, Suhas
doi:10.4230/LIPIcs.SEA.2018.28.  , 2018
Link: https://doi.org/10.4230/..
 
1-15