default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Pettersson
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Jessica A. Enright
, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester:
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation. Algorithmica 86(10): 3186-3230 (2024)- [j11]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
New Algorithms for Hierarchical Optimization in Kidney Exchange Programs. Oper. Res. 72(4): 1654-1673 (2024) - [i10]Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, William Pettersson:
Reachability in temporal graphs under perturbation. CoRR abs/2404.19479 (2024) - 2023
- [c7]Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Cops and Robbers on Multi-Layer Graphs. WG 2023: 319-333 - [i9]Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Cops and Robbers on Multi-Layer Graphs. CoRR abs/2303.03962 (2023) - 2022
- [j10]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson, James Trimble:
Improved instance generation for kidney exchange programmes. Comput. Oper. Res. 141: 105707 (2022) - [j9]William Pettersson:
kep_solver: A Python package for kidney exchange programme exploration. J. Open Source Softw. 7(80): 4881 (2022) - [i8]William Pettersson, John Sylvester:
Bounds on the Twin-Width of Product Graphs. CoRR abs/2202.11556 (2022) - 2021
- [j8]William Pettersson, Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove:
Improving solution times for stable matching problems through preprocessing. Comput. Oper. Res. 128: 105128 (2021) - [j7]Péter Biró, Joris van de Klundert, David F. Manlove, William Pettersson, Tommy Andersson, Lisa Burnapp, Pavel Chromy, Pablo Delgado, Piotr Dworczak, Bernadette Haase, Aline Hemke, Rachel Johnson, Xenia Klimentova, Dirk Kuypers, Alessandro Nanni Costa, Bart Smeulders, Frits C. R. Spieksma, María O. Valentín, Ana Viana:
Modelling and optimisation in European Kidney Exchange Programmes. Eur. J. Oper. Res. 291(2): 447-456 (2021) - [j6]Bart Smeulders, William Pettersson, Ana Viana, Tommy Andersson, Catarina Bolotinha, Pavel Chromy, Margherita Gentile, Karine Hadaya, Aline Hemke, Xenia Klimentova, Dirk Kuypers, David F. Manlove, Matthew Robb, Antonij Slavcev, Paolo Tubertini, María O. Valentín, Joris van de Klundert, Paolo Ferrari:
Data and optimisation requirements for Kidney Exchange Programs. Health Informatics J. 27(2): 146045822110099 (2021) - [j5]Duncan Lee, Kitty Meeks, William Pettersson:
Improved inference for areal unit count data using graph-based optimisation. Stat. Comput. 31(4): 51 (2021) - [c6]Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester:
The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. COCOA 2021: 152-166 - [i7]Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Tangled Paths: A Random Graph Model from Mallows Permutations. CoRR abs/2108.04786 (2021) - 2020
- [j4]William Pettersson, Melih Ozlen:
Multiobjective Integer Programming: Synergistic Parallel Approaches. INFORMS J. Comput. 32(2): 461-472 (2020) - [c5]Péter Biró, Márton Gyetvai, Xenia Klimentova, João Pedro Pedroso, William Pettersson, Ana Viana:
Compensation Scheme With Shapley Value For Multi-Country Kidney Exchange Programmes. ECMS 2020: 129-136 - [i6]Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson:
Directed branch-width: A directed analogue of tree-width. CoRR abs/2009.08903 (2020)
2010 – 2019
- 2019
- [j3]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
Mathematical models for stable matching problems with ties and incomplete lists. Eur. J. Oper. Res. 277(2): 426-441 (2019) - [j2]Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson:
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. SIAM J. Discret. Math. 33(4): 2092-2110 (2019) - [c4]Ciaran McCreesh, William Pettersson, Patrick Prosser:
Understanding the Empirical Hardness of Random Optimisation Problems. CP 2019: 333-349 - [i5]William Pettersson, Melih Ozlen:
Multi-Objective Mixed Integer Programming: An Objective Space Algorithm. CoRR abs/1909.03829 (2019) - 2018
- [i4]Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson:
The parameterized complexity of finding a 2-sphere in a simplicial complex. CoRR abs/1802.07175 (2018) - [i3]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
Mathematical models for stable matching problems with ties and incomplete lists. CoRR abs/1810.02711 (2018) - 2017
- [c3]Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson:
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. STACS 2017: 18:1-18:14 - [i2]William Pettersson, Melih Ozlen:
A parallel approach to bi-objective integer programming. CoRR abs/1701.08920 (2017) - 2015
- [j1]Darryn E. Bryant, Peter Danziger, William Pettersson:
Bipartite 2-Factorizations of Complete Multipartite Graphs. J. Graph Theory 78(4): 287-294 (2015) - [c2]Benjamin A. Burton, William Pettersson:
An Edge-Based Framework for Enumerating 3-Manifold Triangulations. SoCG 2015: 270-284 - 2014
- [c1]Benjamin A. Burton, William Pettersson:
Fixed Parameter Tractable Algorithms in Combinatorial Topology. COCOON 2014: 300-311 - [i1]Benjamin A. Burton, William Pettersson:
Fixed parameter tractable algorithms in combinatorial topology. CoRR abs/1402.3876 (2014)
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-10-23 20:34 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:
