基本信息
浏览量:174
职业迁徙
个人简介
My main research areas are Graph Theory and Combinatorics, studied in algorithmic and computational complexity point of views. In these areas I wrote over 100 research papers (easiest seen at dblp ), which acquired over 1600 citations (according to WOS in March, 2021). The topics I enjoyed working on include
Graph Drawing and Geometric Intersection Graphs, currently in the focus of EUROCORES Collaborative Research Project GraDR EUROGIGA
Graph Covers - Locally constrained graph homomorphisms, partial covers and their computational complexity issues. With Roman Nedela and Jozef Siran we established a series of workshops ATCAGC (Algebraic, Topological and Complexity Aspects of Graph Covers). talk at MCW 2021
Distance Constrained Graph Labeling - stemming from the Frequence Assignment Problem. With J. Fiala and P. Golovach we showed that the L(2,1)-labeling problem is NP-complete for series parallel graphs and the L(p,q)-labeling one even for trees (if q>1 and relatively prime to p).
Domination theory and perfect codes in graphs. Exact exponantial time algorithms for these problems.
Graph Colorings - complexity of precoloring extension problems, list colorings, choosability, binding functions for chromatic number for special classes of graphs.
Graph Drawing and Geometric Intersection Graphs, currently in the focus of EUROCORES Collaborative Research Project GraDR EUROGIGA
Graph Covers - Locally constrained graph homomorphisms, partial covers and their computational complexity issues. With Roman Nedela and Jozef Siran we established a series of workshops ATCAGC (Algebraic, Topological and Complexity Aspects of Graph Covers). talk at MCW 2021
Distance Constrained Graph Labeling - stemming from the Frequence Assignment Problem. With J. Fiala and P. Golovach we showed that the L(2,1)-labeling problem is NP-complete for series parallel graphs and the L(p,q)-labeling one even for trees (if q>1 and relatively prime to p).
Domination theory and perfect codes in graphs. Exact exponantial time algorithms for these problems.
Graph Colorings - complexity of precoloring extension problems, list colorings, choosability, binding functions for chromatic number for special classes of graphs.
研究兴趣
论文共 240 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
CoRR (2024)
引用0浏览0EI引用
0
0
WALCOMpp.3-11, (2023)
CoRR (2023): 323-338
MFCSpp.8:1-8:14, (2023)
引用0浏览0EI引用
0
0
Algorithmicano. 3 (2023): 1-26
Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications (2023)
引用0浏览0引用
0
0
CoRR (2023): 97-113
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn