Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Socała, Arkadiusz
36  Ergebnisse:
Personensuche X
?
1

Tight Lower Bounds for the Complexity of Multicoloring:

Bonamy, Marthe ; Kowalik, łUkasz ; Pilipczuk, Michał..
ACM Transactions on Computation Theory.  11 (2019)  3 - p. 1-19 , 2019
Link: https://doi.org/10.1145/..
 
?
2

Tight Lower Bounds for the Complexity of Multicoloring:

Bonamy, Marthe ; Kowalik, łUkasz ; Pilipczuk, Michał..
ACM Transactions on Computation Theory (TOCT).  11 (2019)  3 - p. 1-19 , 2019
Link: https://dl.acm.org/doi/1..
 
?
3

Improving TSP Tours Using Dynamic Programming over Tree Dec..:

Cygan, Marek ; Kowalik, Łukasz ; Socała, Arkadiusz
ACM Transactions on Algorithms (TALG).  15 (2019)  4 - p. 1-19 , 2019
Link: https://dl.acm.org/doi/1..
 
?
4

Improving TSP Tours Using Dynamic Programming over Tree Dec..:

Cygan, Marek ; Kowalik, Łukasz ; Socała, Arkadiusz
ACM Transactions on Algorithms.  15 (2019)  4 - p. 1-19 , 2019
Link: https://doi.org/10.1145/..
 
?
5

On Directed Feedback Vertex Set Parameterized by Treewidth:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Bonamy, Marthe ; Kowalik, Łukasz ; Nederlof, Jesper... - p. 65-78 , 2018
Link: https://doi.org/10.1007/..
 
?
6

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

Tight Lower Bounds on Graph Embedding Problems:

Cygan, Marek ; Fomin, Fedor V. ; Golovnev, Alexander...
Journal of the ACM.  64 (2017)  3 - p. 1-22 , 2017
Link: https://doi.org/10.1145/..
 
?
8

Tight Lower Bounds on Graph Embedding Problems:

Cygan, Marek ; Fomin, Fedor V. ; Golovnev, Alexander...
Journal of the ACM (JACM).  64 (2017)  3 - p. 1-22 , 2017
Link: https://dl.acm.org/doi/1..
 
?
9

Automatic profile generation for live Linux Memory analysis:

Socała, Arkadiusz ; Cohen, Michael
Digital Investigation.  16 (2016)  - p. S11-S24 , 2016
Link: https://doi.org/10.1016/..
 
?
10

Tight Lower Bound for the Channel Assignment Problem:

Socała, Arkadiusz
ACM Transactions on Algorithms (TALG).  12 (2016)  4 - p. 1-19 , 2016
Link: https://dl.acm.org/doi/1..
 
?
11

Tight bounds for graph homomorphism and subgraph isomorphis:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,
Cygan, Marek ; Fomin, Fedor V. ; Golovnev, Alexander... - p. 1643-1649 , 2016
Link: https://dl.acm.org/doi/1..
 
?
12

Linear Kernels for Outbranching Problems in Sparse Digraphs:

Bonamy, Marthe ; Kowalik, Łukasz ; Pilipczuk, Michał.
Algorithmica.  79 (2016)  1 - p. 159-188 , 2016
Link: https://doi.org/10.1007/..
 
?
13

Tight Lower Bound for the Channel Assignment Problem:

Socała, Arkadiusz
ACM Transactions on Algorithms.  12 (2016)  4 - p. 1-19 , 2016
Link: https://doi.org/10.1145/..
 
?
14

Tight lower bound for the channel assignment problem:

, In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms,
Socała, Arkadiusz - p. 662-675 , 2015
Link: https://dl.acm.org/doi/1..
 
?
15

Assigning Channels Via the Meet-in-the-Middle Approach:

Kowalik, Łukasz ; Socała, Arkadiusz
Algorithmica.  74 (2015)  4 - p. 1435-1452 , 2015
Link: https://doi.org/10.1007/..
 
1-15