A 3-approximation algorithm for the subtree distance between phylogenies von Bordewich, Magnus, McCartin, Catherine, Semple, Charles

Volltext

On the Parameterized Complexity of Layered Graph Drawing von Dujmović, Vida, Fellows, Michael R., Kitching, Matthew, Liotta, Giuseppe, McCartin, Catherine, Nishimura, Naomi, Ragde, Prabhakar, Rosamond, Frances, Whitesides, Sue, Wood, David R.

Volltext

Efficient Sink-Reachability Analysis via Graph Reduction von Dietrich, Jens, Chang, Lijun, Qian, Long, Henry, Lyndon M., McCartin, Catherine, Scholz, Bernhard

Volltext

Parameterized counting problems von McCartin, Catherine

Volltext

Bounding the maximum size of a minimal definitive set of quartets von Dietrich, Max, McCartin, Catherine, Semple, Charles

Volltext

A Faster FPT Algorithm for the Maximum Agreement Forest Problem von Hallett, Michael, McCartin, Catherine

Volltext

Parameterized Approximation Problems von Downey, Rodney G., Fellows, Michael R., McCartin, Catherine

Volltext

Online promise problems with online width metrics von Downey, Rodney G., McCartin, Catherine

Volltext

Network parameters and heuristics in practice: a case study using the target set selection problem von Lowcay, C., Marsland, S., McCartin, C.

Volltext

Parameterized approximation of dominating set problems von Downey, Rodney G., Fellows, Michael R., McCartin, Catherine, Rosamond, Frances

Volltext

A fixed-parameter approach to 2-layer planarization von DUJMOVIC, Vida, FELLOWS, Michael, WHITESIDES, Sue, WOOD, David R, HALLETT, Michael, KITCHING, Matthew, LIOTTA, Giuseppe, MCCARTIN, Catherine, NISHIMURA, Naomi, RAGDE, Prabhakar, ROSAMOND, Fran, SUDERMAN, Matthew

Volltext

On the parametric complexity of schedules to minimize tardy tasks von Fellows, Michael R., McCartin, Catherine

Volltext

Making Smart Moves to Untangle Programs von Shah, S. M. A., Dietrich, J., McCartin, C.

Volltext

An improved algorithm for the jump number problem von McCartin, Catherine

Volltext

Parameterized Counting Problems von McCartin, Catherine

Volltext

On the parametric complexity of schedules to minimize tardy tasks: Australasian Computing Theory von FELLOWS, Michael R, MCCARTIN, Catherine

Volltext

Some New Directions and Questions in Parameterized Complexity von Downey, Rodney G., McCartin, Catherine

Volltext

Barriers to Modularity - An Empirical Study to Assess the Potential for Modularisation of Java Programs von Dietrich, Jens, McCartin, Catherine, Tempero, Ewan, Shah, Syed M. Ali

Volltext

Coordinatized kernels and catalytic reductions : An improved FPT algorithm for max leaf spanning tree and other problems von FELLOWS, Michael R, MCCARTIN, Catherine, ROSAMOND, Frances A, STEGE, Ulrike

Volltext

On the Automated Modularisation of Java Programs Using Service Locators von Shah, Syed Muhammad Ali, Dietrich, Jens, McCartin, Catherine

Volltext