default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Lason
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c2]Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo
:
First-Fit Coloring of Forests in Random Arrival Model. MFCS 2024: 33:1-33:10- [i6]Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo:
First-Fit Coloring of Forests in Random Arrival Model. CoRR abs/2404.17011 (2024) - 2023
- [j14]Michal Lason, Malgorzata Sulkowska:
Modularity of minor-free graphs. J. Graph Theory 102(4): 728-736 (2023) - 2022
- [j13]Michal Lason, Mateusz Michalek:
A Note on Seminormality of Cut Polytopes. SIAM J. Discret. Math. 36(1): 114-117 (2022) - 2021
- [j12]Michal Lason:
Optimal stopping for many connected components in a graph. Random Struct. Algorithms 59(2): 267-287 (2021)
2010 – 2019
- 2017
- [j11]Michal Lason, Wojciech Lubawski:
On-line list coloring of matroids. Discret. Appl. Math. 217: 353-355 (2017) - [j10]Michal Lason:
The coloring game on matroids. Discret. Math. 340(4): 796-799 (2017) - [j9]Michal Lason, Mateusz Michalek:
Non-Normal Very Ample Polytopes - Constructions and Examples. Exp. Math. 26(2): 130-137 (2017) - 2015
- [j8]Michal Lason:
List coloring of matroids and base exchange properties. Eur. J. Comb. 49: 265-268 (2015) - 2014
- [j7]Michal Lason:
Indicated coloring of matroids. Discret. Appl. Math. 179: 241-243 (2014) - [j6]Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak:
Coloring Intersection Graphs of Arc-Connected Sets in the Plane. Discret. Comput. Geom. 52(2): 399-415 (2014) - [j5]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory B 105: 6-10 (2014) - [j4]Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak:
An extremal problem on crossing vectors. J. Comb. Theory A 128: 41-55 (2014) - 2013
- [j3]Michal Lason:
f-Vectors Implying Vertex Decomposability. Discret. Comput. Geom. 49(2): 296-301 (2013) - [j2]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discret. Comput. Geom. 50(3): 714-726 (2013) - [c1]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [i5]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013) - [i4]Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak:
Coloring intersection graphs of arc-connected sets in the plane. CoRR abs/1310.7558 (2013) - 2012
- [i3]Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak:
An extremal problem on crossing vectors. CoRR abs/1205.1824 (2012) - [i2]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. CoRR abs/1209.1595 (2012) - [i1]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free geometric intersection graphs with large chromatic number. CoRR abs/1212.2058 (2012) - 2010
- [j1]Michal Lason:
A Generalization of Combinatorial Nullstellensatz. Electron. J. Comb. 17(1) (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-10-07 21:23 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:
