Grzegorz Kubicki - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2023

Secretary problem with hidden information; searching for a high merit candidateEwa M. Kubicka, Grzegorz Kubicki, Malgorzata Kuchta, Michal Morayne. aam, 144:102468, 2023. [doi]

2022

An optimal algorithm for stopping on the element closest to the center of an intervalEwa M. Kubicka, Grzegorz Kubicki, Malgorzata Kuchta, Malgorzata Sulkowska. aam, 133:102281, 2022. [doi]

2019

Boundary-type sets in maximal outerplanar graphsBenjamin Allgeier, Grzegorz Kubicki. DAM, 266:163-170, 2019. [doi]

2016

Total Colorings of Graphs with Minimum Sum of ColorsEwa Kubicka, Grzegorz Kubicki, Maxfield Leidner. gc, 32(6):2515-2524, 2016. [doi]

2015

Chromatic sums for colorings avoiding monochromatic subgraphsEwa Kubicka, Grzegorz Kubicki, Kathleen A. McKeon. dmgt, 35(3):541-555, 2015. [doi]

2013

An efficient algorithm for stopping on a sink in a directed graphWayne Goddard, Ewa Kubicka, Grzegorz Kubicki. orl, 41(3):238-240, 2013. [doi]

Chromatic Sums for Colorings Avoiding Monochromatic SubgraphsEwa Kubicka, Grzegorz Kubicki, Kathleen A. McKeon. endm, 43:247-254, 2013. [doi]

2012

How to Choose the Best TwinsBryn Garrod, Grzegorz Kubicki, Michal Morayne. siamdm, 26(1):384-398, 2012. [doi]

2008

On domination and reinforcement numbers in treesJean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steve Horton, Patrick Jones, Grzegorz Kubicki. DM, 308(7):1165-1175, 2008. [doi]

2006

Counting chains and antichains in the complete binary treeGrzegorz Kubicki, Jeno Lehel, Michal Morayne. arscom, 79, 2006.

2005

Graph-Theoretic Generalization of the Secretary Problem: The Directed Path CaseGrzegorz Kubicki, Michal Morayne. siamdm, 19(3):622-632, 2005. [doi]

2004

Sphere-of-Influence Graphs on a SphereEwa Kubicka, Grzegorz Kubicki. arscom, 70, 2004.

2003

An Asymptotic Ratio in the Complete Binary TreeGrzegorz Kubicki, Jenö Lehel, Michal Morayne. order, 20(2):91-97, 2003. [doi]

2002

A Ratio Inequality For Binary Trees And The Best SecretaryGrzegorz Kubicki, Jenö Lehel, Michal Morayne. cpc, 11(2):149-161, 2002.

ForewordGrzegorz Kubicki, Jenö Lehel. DM, 249(1-3):1, 2002. [doi]

Patch Colorings and Rigid Colorings of the Rational n-SpaceGrzegorz Kubicki, Jenö Lehel, Michal Morayne. JCT, 84(1):45-53, 2002. [doi]

1998

Steiner Intervals in GraphsEwa Kubicka, Grzegorz Kubicki, Ortrud Oellermann. DAM, 81(1-3):181-190, 1998. [doi]

1997

On Graphs With a Unique Least Common MultipleGary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba. arscom, 46, 1997.

1996

Agreement metrics for trees revisitedEwa Kubicka, Grzegorz Kubicki, Fred R. McMorris. dimacs 1997: 239-248

1993

Agreement Subtrees, Metric and Consensus for Labeled Binary TreesWayne Goddard, Ewa Kubicka, Grzegorz Kubicki, Fred R. McMorris. dimacs 1995: 97-104

Planar graphs and greatest common subgraphsGrzegorz Kubicki. gc, 9(2-4):239-253, 1993. [doi]

1991

On multipartite tournamentsWayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian. JCT, 52(2):284-300, 1991. [doi]

1990

Using Graph Distance in Object RecognitionEwa Kubicka, Grzegorz Kubicki, Ignatios Vakalis. acm 1990: 43-48 [doi]

1989

Approximation Algorithms for the Chromatic SumEwa Kubicka, Grzegorz Kubicki, Dionysios Kountanis. glakes 1991: 15-21

Sign in or sign up to see more results.

runs on WebDSL