Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPieter Kleer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Pieter Kleer
, Hans Simon:
Primal and dual combinatorial dimensions. Discret. Appl. Math. 327: 185-196 (2023)- [j10]Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev:
Secretary and online matching problems with machine learned advice. Discret. Optim. 48(Part 2): 100778 (2023) - [j9]Pieter Kleer:
Price of anarchy for parallel link networks with generalized mean objective. OR Spectr. 45(1): 27-55 (2023) - [c11]Georgios Amanatidis, Pieter Kleer:
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. STACS 2023: 7:1-7:23 - 2022
- [j8]Georgios Amanatidis, Pieter Kleer, Guido Schäfer:
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online. Math. Oper. Res. 47(3): 2286-2309 (2022) - [j7]Georgios Amanatidis, Pieter Kleer:
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices. SIAM J. Discret. Math. 36(1): 118-146 (2022) - [i14]Pieter Kleer, Johan van Leeuwaarden:
Optimal Stopping Theory for a Distributionally Robust Seller. CoRR abs/2206.02477 (2022) - 2021
- [j6]Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie:
Sampling hypergraphs with given degrees. Discret. Math. 344(11): 112566 (2021) - [j5]Pieter Kleer, Guido Schäfer:
Computation and efficiency of potential function minimizers of combinatorial congestion games. Math. Program. 190(1): 523-560 (2021) - [c10]Pieter Kleer:
Sampling from the Gibbs Distribution in Congestion Games. EC 2021: 679-680 - [i13]Pieter Kleer:
Sampling from the Gibbs Distribution in Congestion Games. CoRR abs/2105.12982 (2021) - [i12]Pieter Kleer, Hans Simon:
Primal and Dual Combinatorial Dimensions. CoRR abs/2108.10037 (2021) - [i11]Georgios Amanatidis, Pieter Kleer:
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. CoRR abs/2110.09068 (2021) - 2020
- [j4]Pieter Kleer, Viresh Patel, Fabian Stroh:
Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j3]Georgios Amanatidis, Pieter Kleer:
Rapid mixing of the switch Markov chain for strongly stable degree sequences. Random Struct. Algorithms 57(3): 637-657 (2020) - [c9]Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev:
Secretary and Online Matching Problems with Machine Learned Advice. NeurIPS 2020 - [i10]Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev:
Secretary and Online Matching Problems with Machine Learned Advice. CoRR abs/2006.01026 (2020) - [i9]Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie:
Sampling hypergraphs with given degrees. CoRR abs/2006.12021 (2020) - [i8]Pieter Kleer, Guido Schäfer:
Topological Price of Anarchy Bounds for Clustering Games on Networks. CoRR abs/2011.09717 (2020) - [i7]Pieter Kleer, Viresh Patel, Fabian Stroh:
Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. CoRR abs/2011.09726 (2020)
2010 – 2019
- 2019
- [j2]Pieter Kleer, Guido Schäfer:
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. Theory Comput. Syst. 63(1): 54-89 (2019) - [j1]Pieter Kleer, Guido Schäfer:
Tight inefficiency bounds for perception-parameterized affine congestion games. Theor. Comput. Sci. 754: 65-87 (2019) - [c8]Georgios Amanatidis, Pieter Kleer, Guido Schäfer:
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. EC 2019: 901-919 - [c7]Georgios Amanatidis, Pieter Kleer:
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices. SODA 2019: 966-985 - [c6]Pieter Kleer, Guido Schäfer:
Topological Price of Anarchy Bounds for Clustering Games on Networks. WINE 2019: 241-255 - [i6]Georgios Amanatidis, Pieter Kleer, Guido Schäfer:
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. CoRR abs/1905.00848 (2019) - 2018
- [c5]Corrie Jacobien Carstens, Pieter Kleer:
Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence. APPROX-RANDOM 2018: 36:1-36:18 - [i5]Georgios Amanatidis, Pieter Kleer:
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences. CoRR abs/1803.01338 (2018) - 2017
- [c4]Pieter Kleer, Guido Schäfer:
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games. CIAC 2017: 381-392 - [c3]Pieter Kleer, Guido Schäfer:
Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games. SAGT 2017: 212-224 - [c2]Pieter Kleer, Guido Schäfer:
Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation. EC 2017: 223-240 - [i4]Pieter Kleer, Guido Schäfer:
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games. CoRR abs/1701.07614 (2017) - [i3]Pieter Kleer, Guido Schäfer:
Path deviations outperform approximate stability in heterogeneous congestion games. CoRR abs/1707.01278 (2017) - [i2]Corrie Jacobien Carstens, Pieter Kleer:
Comparing the Switch and Curveball Markov Chains for Sampling Binary Matrices with Fixed Marginals. CoRR abs/1709.07290 (2017) - 2016
- [c1]Pieter Kleer, Guido Schäfer:
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. SAGT 2016: 129-140 - [i1]Pieter Kleer, Guido Schäfer:
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. CoRR abs/1605.01510 (2016)
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-24 22:52 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:
