default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDariusz Leniowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Bartlomiej Bosek
, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
A tight bound for shortest augmenting paths on trees. Theor. Comput. Sci. 901: 45-61 (2022)- 2021
- [c7]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil:
Fully Dynamic k-Center Clustering in Low Dimensional Metrics. ALENEX 2021: 143-153 - 2020
- [j4]Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic Clustering to Minimize the Sum of Radii. Algorithmica 82(11): 3183-3194 (2020)
2010 – 2019
- 2019
- [i4]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Alexander Svozil:
Fully Dynamic k-Center Clustering in Doubling Metrics. CoRR abs/1908.03948 (2019) - [i3]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski:
A Tree Structure For Dynamic Facility Location. CoRR abs/1909.06653 (2019) - 2018
- [j3]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
Shortest Augmenting Paths for Online Matchings on Trees. Theory Comput. Syst. 62(2): 337-348 (2018) - [c6]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski:
A Tree Structure For Dynamic Facility Location. ESA 2018: 39:1-39:13 - [c5]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
A Tight Bound for Shortest Augmenting Paths on Trees. LATIN 2018: 201-216 - 2017
- [c4]Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic Clustering to Minimize the Sum of Radii. ESA 2017: 48:1-48:10 - [i2]Bartlomiej Bosek, Dariusz Leniowski, Anna Zych, Piotr Sankowski:
The Shortest Augmenting Paths for Online Matchings on Trees. CoRR abs/1704.02093 (2017) - [i1]Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic clustering to minimize the sum of radii. CoRR abs/1707.02577 (2017) - 2015
- [j2]Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski:
The ring design game with fair cost allocation. Theor. Comput. Sci. 562: 90-100 (2015) - [c3]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Shortest Augmenting Paths for Online Matchings on Trees. WAOA 2015: 59-71 - 2014
- [c2]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Online Bipartite Matching in Offline Time. FOCS 2014: 384-393 - 2012
- [c1]Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski:
The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. WINE 2012: 546-552 - 2011
- [j1]Jacek Sroka, Lukasz Bieniasz-Krzywiec, Szymon Gwozdz, Dariusz Leniowski, Jakub Lacki, Mateusz Markowski, Claudio Avignone-Rossa, Michael E. Bushell, Johnjoe McFadden, Andrzej M. Kierzek:
Acorn: A grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface. BMC Bioinform. 12: 196 (2011)
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-04-25 05:36 CEST 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:
