Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Arkadiusz Socała
2018
- Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała and Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, Journal Of Artificial Intelligence Research 63 2018, p. 495–513.see in PBN
- Łukasz Kowalik, Juho Lauri and Arkadiusz Aleksander Socała, On the Fine-Grained Complexity of Rainbow Coloring, Siam Journal On Discrete Mathematics 32 (3) 2018, p. 1672–1705.see in PBN
- Łukasz Kowalik and Arkadiusz Aleksander Socała, Tight Lower Bounds for List Edge Coloring, in: 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, 2018, June 18-20, 2018, Malmo, Sweden, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 28:1––28:12.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Jesper Nederlof, Michał Pilipczuk, Arkadiusz Aleksander Socała and Marcin Wrochna, On Directed Feedback Vertex Set Parameterized by Treewidth, in: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, Springer, 2018, p. 65–78.see in PBN
2017
- Marek Adam Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki and Arkadiusz Aleksander Socała, Tight Lower Bounds on Graph Embedding Problems, Journal Of The Acm 64 (3) 2017, p. 18:1–18:22.see in PBN
- Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała and Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., 2017, p. 459–465.see in PBN
- Marek Adam Cygan, Łukasz Kowalik and Arkadiusz Aleksander Socała, Improving TSP Tours Using Dynamic Programming over Tree Decompositions, in: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, p. 30:1–30:14.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk and Arkadiusz Aleksander Socała, Linear Kernels for Outbranching Problems in Sparse Digraphs, Algorithmica 79 (1) 2017, p. 159–188.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk, Arkadiusz Aleksander Socała and Marcin Wrochna, Tight Lower Bounds for the Complexity of Multicoloring, in: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, p. 18:1–18:14.see in PBN
2016
- Łukasz Kowalik and Arkadiusz Aleksander Socała, Assigning Channels Via the Meet-in-the-Middle Approach, Algorithmica 74 (4) 2016, p. 1435–1452.see in PBN
- Arkadiusz Aleksander Socała and Michael Cohen, Automatic profile generation for live Linux Memory analysis, Digital Investigation 16, Supplement 2016, p. S11–S24.see in PBN
- Arkadiusz Aleksander Socała, Tight Lower Bound for the Channel Assignment Problem, Acm Transactions On Algorithms 12 (4) 2016, p. 48.see in PBN
- Łukasz Kowalik, Juho Lauri and Arkadiusz Aleksander Socała, On the Fine-Grained Complexity of Rainbow Coloring, in: 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, p. 58:1–58:16.see in PBN
- Marek Adam Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki and Arkadiusz Aleksander Socała, Tight Bounds for Graph Homomorphism and Subgraph Isomorphism, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, p. 1643–1649.see in PBN
2015
- Arkadiusz Aleksander Socała, Tight lower bound for the channel assignment problem, in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2015, p. 662–675.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Arkadiusz Aleksander Socała and Michał Pilipczuk, Linear Kernels for Outbranching Problems in Sparse Digraphs, in: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, 2015, p. 199–211.see in PBN
You are not logged in | log in
