default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher Purcell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i6]Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima:
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph. CoRR abs/2311.09042 (2023)- 2022
- [j11]William Phan, Christopher Purcell
:
The parameterized complexity of manipulating Top Trading Cycles. Auton. Agents Multi Agent Syst. 36(2): 51 (2022) - [j10]Calum Buchanan, Christopher Purcell, Puck Rombach:
Subgraph Complementation and Minimum Rank. Electron. J. Comb. 29(1) (2022) - [j9]Christopher Purcell, Joe Ryan, Zdenek Ryjácek, Mária Skyvová:
On Exclusive Sum Labellings of Hypergraphs. Graphs Comb. 38(2): 46 (2022) - 2021
- [j8]Christopher Purcell, Puck Rombach:
Role colouring graphs in hereditary classes. Theor. Comput. Sci. 876: 12-24 (2021)
2010 – 2019
- 2018
- [i5]Christopher Purcell, M. Puck Rombach:
Role colouring graphs in hereditary classes. CoRR abs/1802.10180 (2018) - [i4]William Phan, Christopher Purcell:
On the parameterized complexity of manipulating Top Trading Cycles. CoRR abs/1803.02409 (2018) - 2017
- [c1]Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL Problems on Grids. PODC 2017: 101-110 - [i3]Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL problems on grids. CoRR abs/1702.05456 (2017) - [i2]Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski:
Distributed Colour Reduction Revisited. CoRR abs/1709.00901 (2017) - 2015
- [j7]Vadim V. Lozin, Raffaele Mosca, Christopher Purcell:
Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret. Appl. Math. 182: 2-14 (2015) - [j6]Christopher Purcell, M. Puck Rombach:
On the complexity of role colouring planar graphs, trees and cographs. J. Discrete Algorithms 35: 1-8 (2015) - 2014
- [j5]Vadim V. Lozin, Martin Milanic, Christopher Purcell:
Graphs Without Large Apples and the Maximum Weight Independent Set Problem. Graphs Comb. 30(2): 395-410 (2014) - [j4]Vadim V. Lozin, Christopher Purcell:
Coloring vertices of claw-free graphs in three colors. J. Comb. Optim. 28(2): 462-479 (2014) - [j3]Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell:
Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms 26: 45-55 (2014) - [i1]Christopher Purcell, M. Puck Rombach:
On the Complexity of Role Colouring Planar Graphs, Trees and Cographs. CoRR abs/1408.5412 (2014) - 2013
- [j2]Vadim V. Lozin, Raffaele Mosca, Christopher Purcell:
Sparse regular induced subgraphs in 2P3-free graphs. Discret. Optim. 10(4): 304-309 (2013) - [j1]Vadim V. Lozin, Christopher Purcell:
Boundary properties of the satisfiability problems. Inf. Process. Lett. 113(9): 313-317 (2013)
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 23:21 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:
