default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrzegorz Kubicki
Person information
- affiliation: University of Louisville, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Ewa M. Kubicka, Grzegorz Kubicki
, Malgorzata Kuchta, Michal Morayne:
Secretary problem with hidden information; searching for a high merit candidate. Adv. Appl. Math. 144: 102468 (2023)- 2022
- [j19]Ewa M. Kubicka, Grzegorz Kubicki, Malgorzata Kuchta, Malgorzata Sulkowska:
An optimal algorithm for stopping on the element closest to the center of an interval. Adv. Appl. Math. 133: 102281 (2022)
2010 – 2019
- 2019
- [j18]Benjamin Allgeier, Grzegorz Kubicki:
Boundary-type sets in maximal outerplanar graphs. Discret. Appl. Math. 266: 163-170 (2019) - 2016
- [j17]Ewa M. Kubicka, Grzegorz Kubicki, Maxfield Leidner:
Total Colorings of Graphs with Minimum Sum of Colors. Graphs Comb. 32(6): 2515-2524 (2016) - 2015
- [j16]Ewa M. Kubicka, Grzegorz Kubicki, Kathleen A. McKeon:
Chromatic sums for colorings avoiding monochromatic subgraphs. Discuss. Math. Graph Theory 35(3): 541-555 (2015) - 2013
- [j15]Ewa M. Kubicka, Grzegorz Kubicki, Kathleen A. McKeon:
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs. Electron. Notes Discret. Math. 43: 247-254 (2013) - [j14]Wayne Goddard, Ewa M. Kubicka, Grzegorz Kubicki:
An efficient algorithm for stopping on a sink in a directed graph. Oper. Res. Lett. 41(3): 238-240 (2013) - 2012
- [j13]Bryn Garrod, Grzegorz Kubicki, Michal Morayne:
How to Choose the Best Twins. SIAM J. Discret. Math. 26(1): 384-398 (2012)
2000 – 2009
- 2008
- [j12]Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steven B. Horton, Patrick Jones, Grzegorz Kubicki:
On domination and reinforcement numbers in trees. Discret. Math. 308(7): 1165-1175 (2008) - 2006
- [j11]Grzegorz Kubicki, Jeno Lehel, Michal Morayne:
Counting chains and antichains in the complete binary tree. Ars Comb. 79 (2006) - 2005
- [j10]Grzegorz Kubicki, Michal Morayne:
Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case. SIAM J. Discret. Math. 19(3): 622-632 (2005) - 2004
- [j9]Ewa M. Kubicka, Grzegorz Kubicki:
Sphere-of-Influence Graphs on a Sphere. Ars Comb. 70 (2004) - 2003
- [j8]Grzegorz Kubicki, Jenö Lehel, Michal Morayne:
An Asymptotic Ratio in the Complete Binary Tree. Order 20(2): 91-97 (2003) - 2002
- [j7]Grzegorz Kubicki, Jenö Lehel, Michal Morayne:
A Ratio Inequality For Binary Trees And The Best Secretary. Comb. Probab. Comput. 11(2): 149-161 (2002) - [j6]Grzegorz Kubicki, Jenö Lehel:
Foreword. Discret. Math. 249(1-3): 1- (2002) - [j5]Grzegorz Kubicki, Jenö Lehel, Michal Morayne:
Patch Colorings and Rigid Colorings of the Rational n-Space. J. Comb. Theory B 84(1): 45-53 (2002)
1990 – 1999
- 1998
- [j4]Ewa M. Kubicka, Grzegorz Kubicki, Ortrud Oellermann:
Steiner Intervals in Graphs. Discret. Appl. Math. 81(1-3): 181-190 (1998) - 1997
- [j3]Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba:
On Graphs With a Unique Least Common Multiple. Ars Comb. 46 (1997) - 1996
- [c4]Ewa M. Kubicka, Grzegorz Kubicki, Fred R. McMorris:
Agreement metrics for trees revisited. Mathematical Hierarchies and Biology 1996: 239-248 - 1993
- [j2]Grzegorz Kubicki:
Planar graphs and greatest common subgraphs. Graphs Comb. 9(2-4): 239-253 (1993) - [c3]Wayne Goddard, Ewa M. Kubicka, Grzegorz Kubicki, Fred R. McMorris:
Agreement Subtrees, Metric and Consensus for Labeled Binary Trees. Partitioning Data Sets 1993: 97-104 - 1991
- [j1]Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian:
On multipartite tournaments. J. Comb. Theory B 52(2): 284-300 (1991) - 1990
- [c2]Ewa M. Kubicka, Grzegorz Kubicki, Ignatios Vakalis:
Using Graph Distance in Object Recognition. ACM Conference on Computer Science 1990: 43-48
1980 – 1989
- 1989
- [c1]Ewa M. Kubicka, Grzegorz Kubicki, Dionysios Kountanis:
Approximation Algorithms for the Chromatic Sum. Great Lakes Computer Science Conference 1989: 15-21
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-06-10 21:25 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:
