The following pages link to Ioan Todinca (Q344838):
Displayed 25 items.
- Characterizing Minimal Interval Completions (Q3590937) (← links)
- Exact Algorithms for Treewidth and Minimum Fill-In (Q3631902) (← links)
- (Q4251051) (← links)
- (Q4252036) (← links)
- (Q4501558) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)
- Brief Announcement (Q5361942) (← links)
- Large induced subgraphs via triangulations and CMSO (Q5384004) (← links)
- On Dissemination Thresholds in Regular and Irregular Graph Classes (Q5458514) (← links)
- Minimal Interval Completion Through Graph Exploration (Q5459146) (← links)
- Automata, Languages and Programming (Q5466494) (← links)
- Algorithms – ESA 2005 (Q5475850) (← links)
- The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism (Q5496150) (← links)
- Compact Distributed Certification of Planar Graphs (Q5855251) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897571) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902531) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902536) (← links)
- On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model (Q6131191) (← links)
- On the power of threshold-based algorithms for detecting cycles in the CONGEST model (Q6148078) (← links)
- Energy-efficient distributed algorithms for synchronous networks (Q6148079) (← links)
- (Q6168461) (← links)
- A meta-theorem for distributed certification (Q6182681) (← links)
- (Q6192485) (← links)
- On graphs coverable by k shortest paths (Q6403599) (← links)