Karol Suchan

From MaRDI portal
Person:324708

Available identifiers

zbMath Open suchan.karolWikidataQ61050531 ScholiaQ61050531MaRDI QIDQ324708

List of research outcomes





PublicationDate of PublicationType
A case study of consistent vehicle routing problem with time windows2023-11-21Paper
Minimum $k$-critical-bipartite graphs: the irregular Case2023-07-14Paper
$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$2022-12-13Paper
Territory design for the multi-period vehicle routing problem with time windows2022-06-22Paper
Local Optima Network Analysis of Multi-attribute Vehicle Routing Problem2022-05-25Dataset
Zero-sum Partitions of Abelian Groups2022-03-17Paper
Constrained Fitness Landscape Analysis of Vehicle Routing Problems2021-09-27Dataset
Minimum \(k\)-critical bipartite graphs2021-08-02Paper
Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows2020-12-18Paper
https://portal.mardi4nfdi.de/entity/Q45602362018-12-10Paper
Minimum size tree-decompositions2018-05-24Paper
Minimum size tree-decompositions2016-10-17Paper
Computing on rings by oblivious robots: a unified approach for different tasks2015-09-02Paper
Allowing each node to communicate only once in a distributed system: shared whiteboard models2015-07-22Paper
Complexity of splits reconstruction for low-degree trees2014-11-28Paper
Towards optimal kernel for connected vertex cover in planar graphs2013-04-25Paper
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth2012-11-01Paper
Distributed computing of efficient routing schemes in generalized chordal graphs2012-08-10Paper
k-Gap Interval Graphs2012-06-29Paper
Complexity of Splits Reconstruction for Low-Degree Trees2011-12-16Paper
On dissemination thresholds in regular and irregular graph classes2011-03-02Paper
Minimal proper interval completions2010-04-19Paper
Pursuing a fast robber on a graph2010-03-09Paper
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs2010-02-24Paper
Computing Pathwidth Faster Than 2 n2010-01-14Paper
Minimal interval completion through graph exploration2009-02-19Paper
Fast Robber in Planar Graphs2009-01-20Paper
Minimal Proper Interval Completions2008-09-04Paper
Pathwidth of Circular-Arc Graphs2008-07-01Paper
Minimal Interval Completion Through Graph Exploration2008-04-24Paper
On Dissemination Thresholds in Regular and Irregular Graph Classes2008-04-15Paper
On powers of graphs of bounded NLC-width (clique-width)2007-09-19Paper
Characterizing Minimal Interval Completions2007-09-03Paper
Algorithms – ESA 20052006-06-27Paper

Research outcomes over time

This page was built for person: Karol Suchan