default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJana Cslovjecsek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. ESA 2024: 43:1-43:18- [c4]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. SODA 2024: 625-638 - [c3]Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
:
Parameterized algorithms for block-structured integer programs with large entries. SODA 2024: 740-751 - 2023
- [j2]Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
On the independence number of intersection graphs of axis-parallel segments. J. Comput. Geom. 14(1): 144-156 (2023) - [i7]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
A polynomial-time OPTε-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. CoRR abs/2310.20325 (2023) - [i6]Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak:
Parameterized algorithms for block-structured integer programs with large entries. CoRR abs/2311.01890 (2023) - 2022
- [j1]Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura:
Computing the Covering Radius of a Polytope with an Application to Lonely Runners. Comb. 42(4): 463-490 (2022) - [i5]Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
Independence number of intersection graphs of axis-parallel segments. CoRR abs/2205.15189 (2022) - [i4]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. CoRR abs/2212.01620 (2022) - 2021
- [c2]Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ESA 2021: 33:1-33:14 - [c1]Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel:
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. SODA 2021: 1666-1681 - 2020
- [i3]Jana Cslovjecsek, Friedrich Eisenbrand, Robert Weismantel:
N-fold integer programming via LP rounding. CoRR abs/2002.07745 (2020) - [i2]Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura:
Computing the covering radius of a polytope with an application to lonely runners. CoRR abs/2009.12080 (2020) - [i1]Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. CoRR abs/2012.11742 (2020)
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 2024-11-15 20:35 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:
