default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Krzywkowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j13]Sunilkumar M. Hosamani, Shailaja S. Shirkol, Preeti B. Jinagouda, Marcin Krzywkowski:
Degree equitable restrained double domination in graphs. Electron. J. Graph Theory Appl. 9(1): 105-111 (2021)
2010 – 2019
- 2018
- [j12]Michael A. Henning, Marcin Krzywkowski
:
Total domination stability in graphs. Discret. Appl. Math. 236: 246-255 (2018) - [j11]Marcin Krzywkowski, Stephan G. Wagner:
Graphs with few total dominating sets. Discret. Math. 341(4): 997-1009 (2018) - 2017
- [j10]Marcin Krzywkowski:
Double outer-independent domination in graphs. Ars Comb. 134: 193-207 (2017) - [j9]Christoph Brause, Michael A. Henning, Marcin Krzywkowski:
A characterization of trees with equal 2-domination and 2-independence numbers. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - 2016
- [j8]Nader Jafari Rad, Elahe Sharifi, Marcin Krzywkowski:
Domination stability in graphs. Discret. Math. 339(7): 1909-1914 (2016) - 2015
- [i2]Marcin Krzywkowski, Nader Jafari Rad, Sayyed Heidar Jafari:
On the intersection graphs of subspaces of a vector space. CTW 2015: 289-291 - 2014
- [j7]Marcin Krzywkowski:
An Algorithm for Listing all Minimal Double Dominating Sets of a Tree. Fundam. Informaticae 130(4): 415-421 (2014) - [c2]Marcin Krzywkowski:
Minimal Double Dominating Sets in Trees. FAW 2014: 151-157 - 2013
- [j6]Marcin Krzywkowski:
2-bondage in graphs. Int. J. Comput. Math. 90(7): 1358-1365 (2013) - [j5]Marcin Krzywkowski:
Trees having many minimal dominating sets. Inf. Process. Lett. 113(8): 276-279 (2013) - [j4]Marcin Krzywkowski:
Minimal 2-dominating sets in trees. RAIRO Theor. Informatics Appl. 47(3): 235-240 (2013) - [c1]Marcin Krzywkowski:
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree. FAW-AAIM 2013: 12-16 - 2012
- [j3]Rani Hod, Marcin Krzywkowski:
A Construction for the Hat Problem on a Directed Graph. Electron. J. Comb. 19(1): 30 (2012) - 2011
- [j2]Marcin Krzywkowski:
The hat problem on cycles on at least nine vertices. Ars Comb. 101: 3-13 (2011) - [j1]Marcin Krzywkowski:
On trees with double domination number equal to total domination number plus one. Ars Comb. 102: 3-10 (2011) - 2010
- [i1]Rani Hod, Marcin Krzywkowski:
The hat problem on a directed graph. CoRR abs/1006.1587 (2010)
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:00 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:
