default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArkadiusz Socala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j9]Marek Cygan, Lukasz Kowalik
, Arkadiusz Socala:
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. ACM Trans. Algorithms 15(4): 54:1-54:19 (2019)- [j8]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory 11(3): 13:1-13:19 (2019) - 2018
- [j7]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat:
Approximation and Parameterized Complexity of Minimax Approval Voting. J. Artif. Intell. Res. 63: 495-513 (2018) - [j6]Lukasz Kowalik, Juho Lauri, Arkadiusz Socala:
On the Fine-Grained Complexity of Rainbow Coloring. SIAM J. Discret. Math. 32(3): 1672-1705 (2018) - [c10]Lukasz Kowalik, Arkadiusz Socala:
Tight Lower Bounds for List Edge Coloring. SWAT 2018: 28:1-28:12 - [c9]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set Parameterized by Treewidth. WG 2018: 65-78 - [i12]Lukasz Kowalik, Arkadiusz Socala:
Tight Lower Bounds for List Edge Coloring. CoRR abs/1804.02537 (2018) - 2017
- [j5]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica 79(1): 159-188 (2017) - [j4]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. J. ACM 64(3): 18:1-18:22 (2017) - [c8]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat:
Approximation and Parameterized Complexity of Minimax Approval Voting. AAAI 2017: 459-465 - [c7]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight Lower Bounds for the Complexity of Multicoloring. ESA 2017: 18:1-18:14 - [c6]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala:
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. ESA 2017: 30:1-30:14 - [i11]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala:
Improving TSP tours using dynamic programming over tree decomposition. CoRR abs/1703.05559 (2017) - [i10]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set parameterized by treewidth. CoRR abs/1707.01470 (2017) - 2016
- [j3]Lukasz Kowalik, Arkadiusz Socala:
Assigning Channels Via the Meet-in-the-Middle Approach. Algorithmica 74(4): 1435-1452 (2016) - [j2]Arkadiusz Socala, Michael Cohen:
Automatic profile generation for live Linux Memory analysis. Digit. Investig. 16 Supplement: S11-S24 (2016) - [j1]Arkadiusz Socala:
Tight Lower Bound for the Channel Assignment Problem. ACM Trans. Algorithms 12(4): 48:1-48:19 (2016) - [c5]Lukasz Kowalik, Juho Lauri, Arkadiusz Socala:
On the Fine-Grained Complexity of Rainbow Coloring. ESA 2016: 58:1-58:16 - [c4]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. SODA 2016: 1643-1649 - [i9]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. CoRR abs/1602.05016 (2016) - [i8]Lukasz Kowalik, Juho Lauri, Arkadiusz Socala:
On the fine-grained complexity of rainbow coloring. CoRR abs/1602.05608 (2016) - [i7]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight lower bounds for the complexity of multicoloring. CoRR abs/1607.03432 (2016) - [i6]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat:
Approximation and Parameterized Complexity of Minimax Approval Voting. CoRR abs/1607.07906 (2016) - 2015
- [c3]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. IPEC 2015: 199-211 - [c2]Arkadiusz Socala:
Tight lower bound for the channel assignment problem. SODA 2015: 662-675 - [i5]Marek Cygan, Jakub Pachocki, Arkadiusz Socala:
The Hardness of Subgraph Isomorphism. CoRR abs/1504.02876 (2015) - [i4]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear kernels for outbranching problems in sparse digraphs. CoRR abs/1509.01675 (2015) - 2014
- [c1]Lukasz Kowalik, Arkadiusz Socala:
Assigning Channels via the Meet-in-the-Middle Approach. SWAT 2014: 282-293 - [i3]Lukasz Kowalik, Arkadiusz Socala:
Assigning channels via the meet-in-the-middle approach. CoRR abs/1407.7161 (2014) - [i2]Arkadiusz Socala:
Tight lower bound for the channel assignment problem. CoRR abs/1407.7162 (2014) - 2013
- [i1]Michal Farnik, Lukasz Kowalik, Arkadiusz Socala:
Beyond the Shannon's Bound. CoRR abs/1309.6069 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
