default search action
Michal Malafiejski
Person information
- affiliation: Gdansk University of Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c11]Anna Malafiejska, Michal Malafiejski, Krzysztof M. Ocetkiewicz, Krzysztof Pastuszak
:
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees. ISAAC 2021: 26:1-26:12
2010 – 2019
- 2019
- [j19]Robert Lewon
Global edge alliances in graphs. Discret. Appl. Math. 261: 305-315 (2019) - 2018
- [j18]Robert Janczewski, Anna Malafiejska, Michal Malafiejski
On incidence coloring of complete multipartite and semicubic bipartite graphs. Discuss. Math. Graph Theory 38(1): 107-119 (2018) - 2017
- [j17]Anna Malafiejska, Michal Malafiejski
Interval incidence coloring of subcubic graphs. Discuss. Math. Graph Theory 37(2): 427-441 (2017) - 2016
- [j16]Robert Lewon
Strategic balance in graphs. Discret. Math. 339(7): 1837-1847 (2016) - [j15]Robert Lewon
Global defensive sets in graphs. Discret. Math. 339(7): 1861-1870 (2016) - 2015
- [j14]Robert Janczewski, Anna Malafiejska, Michal Malafiejski
Interval incidence graph coloring. Discret. Appl. Math. 182: 73-83 (2015) - 2014
- [j13]Robert Janczewski, Anna Malafiejska, Michal Malafiejski
Interval incidence coloring of bipartite graphs. Discret. Appl. Math. 166: 131-140 (2014)
2000 – 2009
- 2009
- [j12]Robert Janczewski, Adrian Kosowski, Michal Malafiejski
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. Discret. Math. 309(10): 3270-3279 (2009) - [c10]Robert Janczewski, Anna Malafiejska, Michal Malafiejski
Interval Wavelength Assignment in All-Optical Star Networks. PPAM (1) 2009: 11-20 - [c9]Agnieszka Kolenderska, Adrian Kosowski, Michal Malafiejski
An Improved Strategy for Exploring a Grid Polygon. SIROCCO 2009: 222-236 - 2008
- [j11]Adrian Kosowski, Michal Malafiejski
Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph. Graphs Comb. 24(5): 461-468 (2008) - 2007
- [j10]Adrian Kosowski, Michal Malafiejski
Cooperative mobile guards in grids. Comput. Geom. 37(2): 59-71 (2007) - [j9]Lukasz Kuszner
A polynomial algorithm for some preemptive multiprocessor task scheduling problems. Eur. J. Oper. Res. 176(1): 145-150 (2007) - [j8]Adrian Kosowski, Michal Malafiejski
Packing [1, Delta] -factors in graphs of small degree. J. Comb. Optim. 14(1): 63-86 (2007) - [c8]Adrian Kosowski, Michal Malafiejski
Application of an Online Judge & Contester System in Academic Tuition. ICWL 2007: 343-354 - 2006
- [j7]Adrian Kosowski, Michal Malafiejski
An approximation algorithm for maximum P3-packing in subcubic graphs. Inf. Process. Lett. 99(6): 230-233 (2006) - [c7]Adrian Kosowski, Michal Malafiejski
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids. ICCSA (1) 2006: 141-150 - [c6]Adrian Kosowski, Michal Malafiejski
Fault Tolerant Guarding of Grids. ICCSA (1) 2006: 161-170 - 2005
- [c5]Michal Malafiejski, Pawel Zylinski:
Weakly Cooperative Guards in Grids. ICCSA (1) 2005: 647-656 - [c4]Adrian Kosowski, Michal Malafiejski
On Bounded Load Routings for Modeling k-Regular Connection Topologies. ISAAC 2005: 614-623 - [c3]Adrian Kosowski, Michal Malafiejski
Parallel Processing Subsystems with Redundancy in a Distributed Environment. PPAM 2005: 1002-1009 - 2004
- [j6]Michal Malafiejski
Sum Coloring of Bipartite Graphs with Bounded Degree. Algorithmica 40(4): 235-244 (2004) - 2003
- [j5]Krzysztof Giaro
The complexity of the T-coloring problem for graphs with small degree. Discret. Appl. Math. 129(2-3): 361-369 (2003) - [j4]Krzysztof Giaro
A polynomial algorithm for finding T-span of generalized cacti. Discret. Appl. Math. 129(2-3): 371-382 (2003) - 2002
- [c2]Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski:
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. APPROX 2002: 135-145 - 2001
- [j3]Krzysztof Giaro
Consecutive colorings of the edges of general graphs. Discret. Math. 236(1-3): 131-143 (2001) - [j2]Michal Malafiejski
The complexity of the chromatic sum problem on cubic planar graphs and regular graphs. Electron. Notes Discret. Math. 8: 62 (2001) - [c1]Krzysztof Giaro, Marek Kubale, Michal Malafiejski, Konrad Piwakowski:
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time. PPAM 2001: 87-96
1990 – 1999
- 1999
- [j1]Krzysztof Giaro, Marek Kubale
On the Deficiency of Bipartite Graphs. Discret. Appl. Math. 94(1-3): 193-203 (1999)
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:08 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: