The following pages link to Karol Suchan (Q324708):
Displaying 32 items.
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- (Q627515) (redirect page) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Minimal proper interval completions (Q963366) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- Territory design for the multi-period vehicle routing problem with time windows (Q2147160) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- k-Gap Interval Graphs (Q2894479) (← links)
- Complexity of Splits Reconstruction for Low-Degree Trees (Q3104774) (← links)
- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth (Q3167048) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
- Minimal Proper Interval Completions (Q3522959) (← links)
- Characterizing Minimal Interval Completions (Q3590937) (← links)
- Computing Pathwidth Faster Than 2 n (Q3656873) (← links)
- (Q4560236) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
- On Dissemination Thresholds in Regular and Irregular Graph Classes (Q5458514) (← links)
- Minimal Interval Completion Through Graph Exploration (Q5459146) (← links)
- Algorithms – ESA 2005 (Q5475850) (← links)
- Minimum size tree-decompositions (Q5890931) (← links)
- Minimum size tree-decompositions (Q5916057) (← links)
- A case study of consistent vehicle routing problem with time windows (Q6070496) (← links)
- Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows (Q6356478) (← links)
- Constrained Fitness Landscape Analysis of Vehicle Routing Problems (Q6707448) (← links)
- Local Optima Network Analysis of Multi-attribute Vehicle Routing Problem (Q6707450) (← links)
