default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Debski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Michal Debski, Jaroslaw Grytczuk, Bartlomiej Pawlik
:
Extensions and reductions of squarefree words. Discret. Math. 347(3): 113825 (2024)- [j24]Michal Debski:
Edge colorings avoiding patterns. Eur. J. Comb. 117: 103825 (2024) - 2022
- [j23]Michal Debski, Malgorzata Sleszynska-Nowak:
Strong edge coloring of circle graphs. Eur. J. Comb. 102: 103507 (2022) - [j22]Joanna Chybowska-Sokól, Michal Debski, Jaroslaw Grytczuk, Konstanty Junosza-Szaniawski, Barbara Nayar, Urszula Pastwa, Krzysztof Wesek:
Fractional meanings of nonrepetitiveness. J. Comb. Theory A 189: 105598 (2022) - [j21]Michal Debski, Jakub Przybylo:
Conflict-free chromatic number versus conflict-free chromatic index. J. Graph Theory 99(3): 349-358 (2022) - [j20]Michal Debski, Marta Piecyk, Pawel Rzazewski:
Faster 3-Coloring of Small-Diameter Graphs. SIAM J. Discret. Math. 36(3): 2205-2224 (2022) - [c5]Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. ISAAC 2022: 14:1-14:16 - [i3]Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws. CoRR abs/2205.13270 (2022) - 2021
- [j19]Michal Debski, Malgorzata Sleszynska-Nowak:
Strong Cliques in Claw-Free Graphs. Graphs Comb. 37(6): 2581-2593 (2021) - [j18]Michal Debski, Malgorzata Sleszynska-Nowak:
t-Strong Cliques and the Degree-Diameter Problem. SIAM J. Discret. Math. 35(4): 3017-3029 (2021) - [c4]Michal Debski, Marta Piecyk, Pawel Rzazewski:
Faster 3-Coloring of Small-Diameter Graphs. ESA 2021: 37:1-37:15 - [i2]Michal Debski, Marta Piecyk, Pawel Rzazewski:
Faster 3-coloring of small-diameter graphs. CoRR abs/2104.13860 (2021) - 2020
- [j17]Michal Debski, Konstanty Junosza-Szaniawski, Zbigniew Lonc:
Bundling all shortest paths. Discret. Appl. Math. 277: 82-91 (2020) - [j16]Michal Debski, Konstanty Junosza-Szaniawski, Malgorzata Sleszynska-Nowak:
Strong chromatic index of K1, t-free graphs. Discret. Appl. Math. 284: 53-60 (2020) - [j15]Michal Debski, Jaroslaw Grytczuk, Barbara Nayar, Urszula Pastwa, Joanna Sokól, Michal Tuczynski, Przemyslaw Wenus, Krzysztof Wesek:
Avoiding Multiple Repetitions in Euclidean Spaces. SIAM J. Discret. Math. 34(1): 40-52 (2020) - [c3]Michal Debski, Stefan Felsner, Piotr Micek, Felix Schröder:
Improved bounds for centered colorings. SODA 2020: 2212-2226
2010 – 2019
- 2019
- [j14]Michal Debski:
Strong chromatic index of unit distance graphs. J. Graph Theory 90(4): 523-534 (2019) - 2018
- [j13]Bartlomiej Bosek, Michal Debski, Jaroslaw Grytczuk, Joanna Sokól, Malgorzata Sleszynska-Nowak, Wiktor Zelazny:
Graph coloring and Graham's greatest common divisor problem. Discret. Math. 341(3): 781-785 (2018) - [j12]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Achromatic and Harmonious Colorings of Circulant Graphs. J. Graph Theory 87(1): 18-34 (2018) - 2017
- [j11]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of radius k for complete bipartite graphs. Discret. Appl. Math. 225: 51-63 (2017) - [j10]Michal Debski:
Fractional strong chromatic index of bipartite graphs. Discret. Math. 340(7): 1508-1513 (2017) - [j9]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Harmonious and achromatic colorings of fragmentable hypergraphs. Eur. J. Comb. 66: 60-80 (2017) - [j8]Michal Debski, Jaroslaw Grytczuk, Urszula Pastwa, Barbara Pilat, Joanna Sokól, Michal Tuczynski, Przemyslaw Wenus, Krzysztof Wesek:
On avoding r-repetitions in ℝ2. Electron. Notes Discret. Math. 61: 331-337 (2017) - [c2]Michal Debski, Jakub Janusz Koperwas:
Web-Enabled Discovery and Launch. MoMM 2017: 191-195 - [i1]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of radius k for complete bipartite graphs. CoRR abs/1711.05091 (2017) - 2016
- [j7]Michal Debski, Urszula Pastwa, Krzysztof Wesek:
Grasshopper Avoidance of Patterns. Electron. J. Comb. 23(4): 4 (2016) - [j6]Michal Debski, Zbigniew Lonc:
Universal Cycle Packings and Coverings for k-Subsets of an n-Set. Graphs Comb. 32(6): 2323-2337 (2016) - [c1]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of Radius k for Complete Bipartite Graphs. WG 2016: 1-12 - 2015
- [j5]Michal Debski:
On a topological relaxation of a conjecture of Erdős and Nešetřil. Eur. J. Comb. 49: 188-193 (2015) - [j4]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Harmonious and achromatic colorings of fragmentable hypergraphs. Electron. Notes Discret. Math. 49: 309-314 (2015) - [j3]Michal Debski, Jaroslaw Grytczuk, Malgorzata Sleszynska-Nowak:
The strong chromatic index of sparse graphs. Inf. Process. Lett. 115(2): 326-330 (2015) - 2014
- [j2]Michal Debski, Zbigniew Lonc:
Sequences of large radius. Eur. J. Comb. 41: 197-204 (2014) - 2012
- [j1]Michal Debski:
Perfect matchings in antipodally colored lattice of subsets. Discret. Math. 312(23): 3457-3460 (2012)
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:
