Grzegorz Kubicki

Orcid: 0000-0002-5531-167X

Affiliations:
  • University of Louisville, Department of Mathematics


According to our database1, Grzegorz Kubicki authored at least 23 papers between 1989 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Secretary problem with hidden information; searching for a high merit candidate.
Adv. Appl. Math., 2023

2022
An optimal algorithm for stopping on the element closest to the center of an interval.
Adv. Appl. Math., 2022

2019
Boundary-type sets in maximal outerplanar graphs.
Discret. Appl. Math., 2019

2016
Total Colorings of Graphs with Minimum Sum of Colors.
Graphs Comb., 2016

2013
An efficient algorithm for stopping on a sink in a directed graph.
Oper. Res. Lett., 2013

Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs.
Electron. Notes Discret. Math., 2013

2012
How to Choose the Best Twins.
SIAM J. Discret. Math., 2012

2008
On domination and reinforcement numbers in trees.
Discret. Math., 2008

2006
Counting chains and antichains in the complete binary tree.
Ars Comb., 2006

2005
Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case.
SIAM J. Discret. Math., 2005

2004
Sphere-of-Influence Graphs on a Sphere.
Ars Comb., 2004

2003
An Asymptotic Ratio in the Complete Binary Tree.
Order, 2003

2002
Patch Colorings and Rigid Colorings of the Rational n-Space.
J. Comb. Theory, Ser. B, 2002

Foreword.
Discret. Math., 2002

A Ratio Inequality For Binary Trees And The Best Secretary.
Comb. Probab. Comput., 2002

1998
Steiner Intervals in Graphs.
Discret. Appl. Math., 1998

1997
On Graphs With a Unique Least Common Multiple.
Ars Comb., 1997

1996
Agreement metrics for trees revisited.
Proceedings of the Mathematical Hierarchies and Biology, 1996

1993
Planar graphs and greatest common subgraphs.
Graphs Comb., 1993

Agreement Subtrees, Metric and Consensus for Labeled Binary Trees.
Proceedings of the Partitioning Data Sets, Proceedings of a DIMACS Workshop, 1993

1991
On multipartite tournaments.
J. Comb. Theory, Ser. B, 1991

1990
Using Graph Distance in Object Recognition.
Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990

1989
Approximation Algorithms for the Chromatic Sum.
Proceedings of the Computing in the 90's, 1989


  Loading...