default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas Korpelainen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j15]Nicholas Korpelainen, Ovidiu Bagdasar
, Peter J. Larcombe:
Preface. Electron. Notes Discret. Math. 71: 1-2 (2019)- 2018
- [j14]Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev:
Infinitely many minimal classes of graphs of unbounded clique-width. Discret. Appl. Math. 248: 145-152 (2018) - [j13]Nicholas Korpelainen:
A Boundary Class for the k-Path Partition Problem. Electron. Notes Discret. Math. 67: 49-56 (2018) - [j12]Nicholas Korpelainen, Mathew Stubley:
An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants. Electron. Notes Discret. Math. 70: 55-58 (2018) - 2017
- [j11]Robert Brignall, Nicholas Korpelainen, Vincent Vatter:
Linear Clique-Width for Hereditary Classes of Cographs. J. Graph Theory 84(4): 501-511 (2017) - 2016
- [j10]Nicholas Korpelainen:
A New Graph Construction of Unbounded Clique-width. Electron. Notes Discret. Math. 56: 31-36 (2016) - 2015
- [j9]Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter:
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. Electron. J. Comb. 22(2): 2 (2015) - 2014
- [j8]Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill:
Split Permutation Graphs. Graphs Comb. 30(3): 633-646 (2014) - [j7]Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell:
Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms 26: 45-55 (2014) - 2013
- [j6]Nicholas Korpelainen, Vadim V. Lozin, Igor Razgon:
Boundary Properties of Well-Quasi-Ordered Sets of Graphs. Order 30(3): 723-735 (2013) - 2011
- [j5]Domingos Moreira Cardoso, Nicholas Korpelainen, Vadim V. Lozin:
On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discret. Appl. Math. 159(7): 521-531 (2011) - [j4]Nicholas Korpelainen, Vadim V. Lozin:
Two forbidden induced subgraphs and well-quasi-ordering. Discret. Math. 311(16): 1813-1822 (2011) - [j3]Nicholas Korpelainen, Vadim V. Lozin:
Bipartite induced subgraphs and well-quasi-ordering. J. Graph Theory 67(3): 235-249 (2011) - [j2]Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin:
Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412(29): 3545-3554 (2011) - 2009
- [j1]Nicholas Korpelainen:
A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs. Electron. Notes Discret. Math. 32: 133-140 (2009)
Conference and Workshop Papers
- 2010
- [c2]Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin:
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. TAMC 2010: 320-327 - 2009
- [c1]Nicholas Korpelainen, Vadim V. Lozin:
Bipartite Graphs of Large Clique-Width. IWOCA 2009: 385-395
Informal and Other Publications
- 2017
- [i1]Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev:
Infinitely many minimal classes of graphs of unbounded clique-width. CoRR abs/1701.08857 (2017)
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-07 22:06 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:
