Karol Suchan

Available identifiers

zbMath Open suchan.karolWikidataQ61050531 ScholiaQ61050531MaRDI QIDQ324708

List of research outcomes

Publication	Date of Publication	Type
A case study of consistent vehicle routing problem with time windows	2023-11-21	Paper
Minimum $k$-critical-bipartite graphs: the irregular Case	2023-07-14	Paper
$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$	2022-12-13	Paper
Territory design for the multi-period vehicle routing problem with time windows	2022-06-22	Paper
Local Optima Network Analysis of Multi-attribute Vehicle Routing Problem	2022-05-25	Dataset
Zero-sum Partitions of Abelian Groups	2022-03-17	Paper
Constrained Fitness Landscape Analysis of Vehicle Routing Problems	2021-09-27	Dataset
Minimum \(k\)-critical bipartite graphs	2021-08-02	Paper
Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows	2020-12-18	Paper
https://portal.mardi4nfdi.de/entity/Q4560236	2018-12-10	Paper
Minimum size tree-decompositions	2018-05-24	Paper
Minimum size tree-decompositions	2016-10-17	Paper
Computing on rings by oblivious robots: a unified approach for different tasks	2015-09-02	Paper
Allowing each node to communicate only once in a distributed system: shared whiteboard models	2015-07-22	Paper
Complexity of splits reconstruction for low-degree trees	2014-11-28	Paper
Towards optimal kernel for connected vertex cover in planar graphs	2013-04-25	Paper
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth	2012-11-01	Paper
Distributed computing of efficient routing schemes in generalized chordal graphs	2012-08-10	Paper
k-Gap Interval Graphs	2012-06-29	Paper
Complexity of Splits Reconstruction for Low-Degree Trees	2011-12-16	Paper
On dissemination thresholds in regular and irregular graph classes	2011-03-02	Paper
Minimal proper interval completions	2010-04-19	Paper
Pursuing a fast robber on a graph	2010-03-09	Paper
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs	2010-02-24	Paper
Computing Pathwidth Faster Than 2 n	2010-01-14	Paper
Minimal interval completion through graph exploration	2009-02-19	Paper
Fast Robber in Planar Graphs	2009-01-20	Paper
Minimal Proper Interval Completions	2008-09-04	Paper
Pathwidth of Circular-Arc Graphs	2008-07-01	Paper
Minimal Interval Completion Through Graph Exploration	2008-04-24	Paper
On Dissemination Thresholds in Regular and Irregular Graph Classes	2008-04-15	Paper
On powers of graphs of bounded NLC-width (clique-width)	2007-09-19	Paper
Characterizing Minimal Interval Completions	2007-09-03	Paper
Algorithms – ESA 2005	2006-06-27	Paper

Research outcomes over time

This page was built for person: Karol Suchan