Combinatorial Optimization Group

Submitted by pawel.zylinski on Thu, 02/03/2022 - 14:29
University
University of Gdańsk
Faculty/school/department
Faculty of Mathematics, Physics, and Informatics
Size of the team
number of researchers number of supporting staff number of PhD students
9
1
0
Composition of Joint Unit of Research, if relevant

N/A

PI
PI name
Paweł Żyliński
PI email
zylinski@ug.edu.pl
PI bio

Habilitation (Mathematics, with regard to Computer Science):
    The Polish Academy of Sciences (Warsaw, 2014)
Research area: Combinatorics, Graph Theory, Computational Geometry

ORCID: 0000-0001-6378-7742

Work history
   •  1.10.2000 – 31.04.2005, Univeristy of Gdańsk (Institute of Mathematics), Teaching Assistant
   •  1.05.2005 – 31.04.2007, Univeristy of Gdańsk (Institute of Mathematics), Assistant Professor
   •  1.05.2007 – 31.01.2015, Uniwersytet of Gdańsk (Institute of Informatics), Assistant Professor
   •  1.02.2015 – Present, Uniwersytet of Gdańsk (Institute of Informatics), Associate Professor

Research visits

Short and long term stays: University of Wisconsin-Milwaukee (USA), Lund University (Sweden), Kyushu University (Japan), University of Ioannina (Greece), State University of New York at Stony Brook (USA), Malmo University (Sweden), Polytechnic University of Catalonia (Spain).

Contact person and e-mail
Contact person
Paweł Żyliński
Contact person e-mail
zylinsi@ug.edu.pl
WWW
https://inf.ug.edu.pl/ag
Short description of research profile
  • Graph theory and its applications
  • Extreme graph theory
  • Combinatorics
  • Algorithms and data structures
  • Computational complexity
  • Discrete optimization (task scheduling)
  • Discrete and computational geometry
  • The theory of concurrency
  • Stochastic networks and their reliability

 

Research area
NATURAL SCIENCES » Mathematics » (PQ) MATHEMATICS
NATURAL SCIENCES » Computer and information sciences » (EX) COMPUTER SCIENCE, THEORY & METHODS
Scientific Themes (keywords)
discrete mathematics
combinatorics
graph theory
discrete optimization
computational geometry
algorithms
data structures
graph coloring
domination
Ramsey number
Publications

Representative publications

A. Martínez-Moraian, D. Orden, L. Palios, C. Seara, P. Żyliński: Optimizing generalized kernels of polygons. Journal of Global Optimization 80(4), 887-920 (2021) [https://doi.org/10.1007/s10898-021-01020-3]
E. Drgas-Burchardt, H. Furmańczyk, E. Sidorowicz: Equitable improper choosability of graphs. Theoretical Computer Science 844, 34-45 (2020) [https://doi.org/10.1016/j.tcs.2020.08.001].
J.Dybizbański, T. Dzido, R. Zakrzewska: On-line Ramsey numbers for paths and short cycles. Discrete Applied Mathematics 282, 265-270 (2020) [https://doi.org/10.1016/j.dam.2020.03.004]
M. Miotk, J. Topp, P. Żyliński: Disjoint dominating and 2-dominating sets in graphs. Discrete Optimization 35, Article 100553 (2020) [https://doi.org/10.1016/j.disopt.2019.100553]
R. Ziemann, P. Żyliński: Vertex-edge domination in cubic graphs. Discrete Mathematics 343(11), Article 112075 (2020) [https://doi.org/10.1016/j.disc.2020.112075]

Link to extended list of publication

https://inf.ug.edu.pl/ag
Existing collaborations within the SEA-EU alliance
N/A