The following pages link to Dariusz Dereniowski (Q248952):
Displaying 50 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- Brushing with additional cleaning restrictions (Q300254) (← links)
- On minimum cost edge searching (Q391138) (← links)
- Phutball is PSPACE-hard (Q410721) (← links)
- Drawing maps with advice (Q433400) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
- The complexity of node blocking for dags (Q616455) (← links)
- Connected searching of weighted trees (Q719311) (← links)
- Collaborative exploration of trees by energy-constrained mobile robots (Q722216) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- Vertex rankings of chordal graphs and weighted trees (Q844166) (← links)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- Edge ranking and searching in partial orders (Q955315) (← links)
- Maximum vertex occupation time and inert fugitive: Recontamination does help (Q987778) (← links)
- The snow team problem (clearing directed subgraphs by mobile agents) (Q1679971) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Shared multi-processor scheduling (Q1753597) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Gossiping by energy-constrained mobile agents in tree networks (Q1998846) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Shared processor scheduling of multiprocessor jobs (Q2282535) (← links)
- Shared processor scheduling (Q2317136) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Distinguishing views in symmetric networks: a tight lower bound (Q2342668) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- Fast collaborative graph exploration (Q2347797) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- Collision-free network exploration (Q2396820) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- Three-fast-searchable graphs (Q2446838) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Edge ranking of weighted trees (Q2495900) (← links)
- Optimal edge-coloring with edge rate constraints (Q2811307) (← links)
- Distributed Evacuation in Graphs with Multiple Exits (Q2835028) (← links)
- Bounds on the Cover Time of Parallel Rotor Walks (Q2965489) (← links)
- (Q3070239) (← links)
- From Pathwidth to Connected Pathwidth (Q3113706) (← links)
- The Complexity of Zero-Visibility Cops and Robber (Q3188833) (← links)
- Collaborative Exploration by Energy-Constrained Mobile Robots (Q3460728) (← links)
- Minimum vertex ranking spanning tree problem for chordal and proper interval graphs (Q3559377) (← links)
- (Q3575439) (← links)
- Connected Searching of Weighted Trees (Q3586095) (← links)
