Pages that link to "Item:Q5711526"
From MaRDI portal
The following pages link to SOFSEM 2005: Theory and Practice of Computer Science (Q5711526):
Displaying 14 items.
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- Constraint bipartite vertex cover: simpler exact algorithms and implementations (Q431922) (← links)
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Drawing graphs in two layers (Q1331939) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- A fixed-parameter approach to 2-layer planarization (Q2498928) (← links)
- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization (Q3378513) (← links)
- Two-Layer Planarization: Improving on Parameterized Algorithmics (Q3378516) (← links)
- Graph Drawing (Q5896904) (← links)
