skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, May 16 until 2:00 AM ET on Saturday, May 17 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Pilipczuk, Marcin"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, Society for Industrial and Applied Mathematics)
    Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC’10) implies that there is no f (k) · n^o(k/ log k) time algorithm that can solve 2-CSPs with k constraints (over a domain of arbitrary large size n) for any computable function f . This lower bound is widely used to show that certain parameterized problems cannot be solved in time f (k) · n^o(k/ log k) time (assuming the ETH). The purpose of this note is to give a streamlined proof of this result. 
    more » « less
    Accepted Manuscript Full Text Available
  2. ; ; ; (, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)
    Beyersdorff, Olaf; Kanté, Mamadou Moustapha; Kupferman, Orna; Lokshtanov, Daniel (Ed.)
    We revisit the recent polynomial-time algorithm for the Max Weight Independent Set (MWIS) problem in bounded-degree graphs that do not contain a fixed graph whose every component is a subdivided claw as an induced subgraph [Abrishami, Chudnovsky, Dibek, Rzążewski, SODA 2022]. First, we show that with an arguably simpler approach we can obtain a faster algorithm with running time n^{𝒪(Δ²)}, where n is the number of vertices of the instance and Δ is the maximum degree. Then we combine our technique with known results concerning tree decompositions and provide a polynomial-time algorithm for MWIS in graphs excluding a fixed graph whose every component is a subdivided claw as an induced subgraph, and a fixed biclique as a subgraph. 
    more » « less
    Full Text Available 
  3. ; ; ; (, 64th IEEE Symposium on Foundations of Computer Science (FOCS 2023))
    Accepted Manuscript Full Text Available
  4. ; ; ; ; (, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing)
    Full Text Available 
  5. ; ; ; (, SIAM Journal on Discrete Mathematics)
    null (Ed.)
    Full Text Available