| Publication | Date of Publication | Type |
|---|
| The parameterized complexity of guarding almost convex polygons | 2024-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187041 | 2024-02-05 | Paper |
| An ETH-tight algorithm for bidirected Steiner connectivity | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147260 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147261 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147302 | 2024-01-15 | Paper |
| Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor | 2023-12-08 | Paper |
| Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089671 | 2023-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059946 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059988 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059994 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084414 | 2023-10-31 | Paper |
| Polynomial Kernel for Interval Vertex Deletion | 2023-10-23 | Paper |
| Erdős–Pósa property of obstructions to interval graphs | 2023-10-09 | Paper |
| Lower Bound for Independence Covering in $C_4$-Free Graphs | 2023-08-29 | Paper |
| Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition | 2023-08-09 | Paper |
| Gehrlein stable committee with multi-modal preferences | 2023-07-28 | Paper |
| Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems | 2023-04-26 | Paper |
| The chromatic number of squares of random graphs | 2023-04-19 | Paper |
| Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering | 2023-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875544 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875739 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875748 | 2023-02-03 | Paper |
| On the maximum number of edges in chordal graphs of bounded degree and matching number | 2022-12-08 | Paper |
| Highly unbreakable graph with a fixed excluded minor are almost rigid | 2022-10-26 | Paper |
| Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths | 2022-10-19 | Paper |
| On the maximum number of edges in chordal graphs of bounded degree and matching number | 2022-10-13 | Paper |
| Multiplicative Parameterization Above a Guarantee | 2022-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091159 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091173 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091216 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091217 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092361 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077647 | 2022-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075784 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075790 | 2022-05-11 | Paper |
| On the Parameterized Approximability of Contraction to Classes of Chordal Graphs | 2022-03-29 | Paper |
| On the parameterized complexity of reconfiguration of connected dominating sets | 2022-03-25 | Paper |
| Computation of Hadwiger Number and Related Contraction Problems | 2022-03-22 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2022-02-16 | Paper |
| Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space | 2022-02-16 | Paper |
| Randomized Contractions Meet Lean Decompositions | 2022-02-08 | Paper |
| Parameterized Algorithms | 2022-02-04 | Paper |
| On the threshold of intractability | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005155 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009473 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009489 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009491 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002795 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002822 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993296 | 2021-06-15 | Paper |
| Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms | 2021-05-03 | Paper |
| Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems | 2021-05-03 | Paper |
| Computing the largest bond and the maximum connected cut of a graph | 2021-04-19 | Paper |
| Bisection of bounded treewidth graphs by convolutions | 2021-04-14 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2021-02-02 | Paper |
| Parameterized Complexity and Approximability of Directed Odd Cycle Transversal | 2021-02-02 | Paper |
| Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs | 2021-02-02 | Paper |
| An exponential time parameterized algorithm for planar disjoint paths | 2021-01-19 | Paper |
| Hitting topological minors is FPT | 2021-01-19 | Paper |
| Bidimensionality and Kernels | 2021-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136298 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136332 | 2020-11-25 | Paper |
| Faster and enhanced inclusion-minimal cograph completion | 2020-11-02 | Paper |
| Going Far from Degeneracy | 2020-10-29 | Paper |
| A New Perspective on FO Model Checking of Dense Graph Classes | 2020-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115789 | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304101 | 2020-08-05 | Paper |
| Path Contraction Faster than $2^n$ | 2020-07-30 | Paper |
| Dominated Minimal Separators are Tame (Nearly All Others are Feral) | 2020-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111387 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111396 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111402 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111746 | 2020-05-27 | Paper |
| A polynomial sized kernel for tracking paths problem | 2020-02-12 | Paper |
| A polynomial sized kernel for tracking paths problem | 2020-01-16 | Paper |
| Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS | 2020-01-16 | Paper |
| Simultaneous Feedback Vertex Set | 2019-12-16 | Paper |
| Split Contraction | 2019-12-16 | Paper |
| Spanning Circuits in Regular Matroids | 2019-12-02 | Paper |
| Approximation Schemes for Low-rank Binary Matrix Approximation Problems | 2019-12-02 | Paper |
| Exact Algorithms via Monotone Local Search | 2019-11-21 | Paper |
| Finding, hitting and packing cycles in subexponential time on unit disk graphs | 2019-11-07 | Paper |
| Balanced Judicious Bipartition is Fixed-Parameter Tractable | 2019-10-28 | Paper |
| On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets | 2019-10-01 | Paper |
| Packing Cycles Faster Than Erdos--Posa | 2019-08-29 | Paper |
| Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms | 2019-06-20 | Paper |
| A Near-Optimal Planarization Algorithm | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743379 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743499 | 2019-05-10 | Paper |
| Minimum Bisection Is Fixed-Parameter Tractable | 2019-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633895 | 2019-05-06 | Paper |
| The Complexity of Independent Set Reconfiguration on Bipartite Graphs | 2019-03-28 | Paper |
| Clique-width III | 2019-03-28 | Paper |
| Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion | 2019-03-28 | Paper |
| Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems | 2019-03-28 | Paper |
| Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs | 2019-02-14 | Paper |
| Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree | 2019-02-06 | Paper |
| Kernelization | 2019-01-14 | Paper |
| Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes | 2018-12-06 | Paper |
| Covering Vectors by Spaces: Regular Matroids | 2018-11-19 | Paper |
| Deterministic Truncation of Linear Matroids | 2018-11-13 | Paper |
| Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal | 2018-11-13 | Paper |
| Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth | 2018-11-13 | Paper |
| Independence and Efficient Domination on P 6 -free Graphs | 2018-11-12 | Paper |
| Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors | 2018-11-12 | Paper |
| Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp> | 2018-11-12 | Paper |
| Uniform Kernelization Complexity of Hitting Forbidden Minors | 2018-11-05 | Paper |
| On Problems as Hard as CNF-SAT | 2018-11-05 | Paper |
| Representative Families of Product Families | 2018-11-05 | Paper |
| Kernelization Lower Bounds Through Colors and IDs | 2018-10-30 | Paper |
| Faster Parameterized Algorithms Using Linear Programming | 2018-10-30 | Paper |
| Long directed \((s,t)\)-path: FPT algorithm | 2018-10-19 | Paper |
| Below All Subsets for Minimal Connected Dominating Set | 2018-09-26 | Paper |
| Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms | 2018-08-02 | Paper |
| (Meta) Kernelization | 2018-08-02 | Paper |
| Kernelization of Cycle Packing with Relaxed Disjointness Constraints | 2018-07-18 | Paper |
| Independence and Efficient Domination on P6-free Graphs | 2018-07-16 | Paper |
| Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion | 2018-07-16 | Paper |
| Fully polynomial-time parameterized computations for graphs and matrices of low treewidth | 2018-07-16 | Paper |
| Spanning Circuits in Regular Matroids | 2018-07-16 | Paper |
| Beating Brute Force for Systems of Polynomial Equations over Finite Fields | 2018-07-16 | Paper |
| Slightly Superexponential Parameterized Problems | 2018-06-05 | Paper |
| Reconfiguration on sparse graphs | 2018-05-08 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-05-02 | Paper |
| A New Perspective on FO Model Checking of Dense Graph Classes | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636571 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636602 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636630 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634403 | 2018-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607889 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607895 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607896 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607901 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608015 | 2018-03-15 | Paper |
| Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms | 2018-03-15 | Paper |
| Faster and enhanced inclusion-minimal cograph completion | 2018-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132873 | 2018-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601856 | 2018-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601901 | 2018-01-24 | Paper |
| Critical node cut parameterized by treewidth and solution size is \(W[1\)-hard] | 2018-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598162 | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369514 | 2017-10-17 | Paper |
| Quick but odd growth of cacti | 2017-10-10 | Paper |
| Solving d-SAT via Backdoors to Small Treewidth | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363780 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365078 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365079 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365080 | 2017-09-29 | Paper |
| Exact Algorithms via Monotone Local Search | 2017-09-29 | Paper |
| Lossy kernelization | 2017-08-17 | Paper |
| Hitting Selected (Odd) Cycles | 2017-08-14 | Paper |
| Faster exact algorithms for some terminal set problems | 2017-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978504 | 2017-04-25 | Paper |
| Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth | 2017-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957874 | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957518 | 2017-01-26 | Paper |
| Irrelevant vertices for the planar disjoint paths problem | 2016-11-25 | Paper |
| Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) | 2016-07-22 | Paper |
| A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion | 2016-05-03 | Paper |
| A $c^k n$ 5-Approximation Algorithm for Treewidth | 2016-04-11 | Paper |
| On the ordered list subgraph embedding problems | 2016-04-06 | Paper |
| Hitting Forbidden Minors: Approximation and Kernelization | 2016-03-04 | Paper |
| The Structure of $W_4$-Immersion-Free Graphs | 2016-02-05 | Paper |
| On the threshold of intractability | 2015-11-19 | Paper |
| Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints | 2015-11-19 | Paper |
| Reconfiguration on sparse graphs | 2015-10-30 | Paper |
| Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree | 2015-10-27 | Paper |
| Uniform Kernelization Complexity of Hitting Forbidden Minors | 2015-10-27 | Paper |
| Deterministic Truncation of Linear Matroids | 2015-10-27 | Paper |
| Linear Time Parameterized Algorithms for Subset Feedback Vertex Set | 2015-10-27 | Paper |
| Distortion is Fixed Parameter Tractable | 2015-09-24 | Paper |
| Parameterized Algorithms | 2015-08-17 | Paper |
| Minimum bisection is fixed parameter tractable | 2015-06-26 | Paper |
| Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width | 2015-02-09 | Paper |
| On cutwidth parameterized by vertex cover | 2014-12-02 | Paper |
| Representative Sets of Product Families | 2014-10-08 | Paper |
| Solving Multicut Faster Than 2 n | 2014-10-08 | Paper |
| Kernel(s) for problems with no kernel | 2014-09-09 | Paper |
| Saving space by algebraization | 2014-08-13 | Paper |
| (Meta) Kernelization | 2014-07-25 | Paper |
| Parameterized Complexity of Bandwidth on Trees | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417642 | 2014-05-22 | Paper |
| Bidimensionality and Geometric Graphs | 2014-05-22 | Paper |
| Imbalance is fixed parameter tractable | 2014-04-14 | Paper |
| Obtaining a Bipartite Graph by Contracting Few Edges | 2014-04-10 | Paper |
| On the hardness of losing width | 2014-03-25 | Paper |
| Contracting graphs to paths and trees | 2014-03-25 | Paper |
| Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization | 2014-01-16 | Paper |
| Beyond bidimensionality: parameterized subexponential algorithms on directed graphs | 2014-01-10 | Paper |
| On the ordered list subgraph embedding problems | 2013-12-10 | Paper |
| The Fine Details of Fast Dynamic Programming over Tree Decompositions | 2013-12-10 | Paper |
| Faster Exact Algorithms for Some Terminal Set Problems | 2013-12-10 | Paper |
| On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges | 2013-12-10 | Paper |
| Hardness of r-dominating set on Graphs of Diameter (r + 1) | 2013-12-10 | Paper |
| Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles | 2013-11-15 | Paper |
| Parameterized Tractability of Multiway Cut with Parity Constraints | 2013-08-12 | Paper |
| Computing optimal Steiner trees in polynomial space | 2013-08-05 | Paper |
| Clustering with local restrictions | 2013-06-06 | Paper |
| Subexponential algorithms for partial cover problems | 2013-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904144 | 2013-01-28 | Paper |
| Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time | 2013-01-04 | Paper |
| Cops and robber game without recharging | 2012-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2920126 | 2012-10-24 | Paper |
| Treewidth governs the complexity of target set selection | 2012-10-16 | Paper |
| On the directed full degree spanning tree problem | 2012-10-16 | Paper |
| Kernelization – Preprocessing with a Guarantee | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2911626 | 2012-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908877 | 2012-08-29 | Paper |
| Faster algorithms for finding and counting subgraphs | 2012-08-17 | Paper |
| Local search: is brute-force avoidable? | 2012-08-17 | Paper |
| Contracting graphs to paths and trees | 2012-06-15 | Paper |
| On the Hardness of Losing Width | 2012-06-15 | Paper |
| On Cutwidth Parameterized by Vertex Cover | 2012-06-15 | Paper |
| Sharp separation and applications to exact and parameterized algorithms | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389996 | 2012-04-24 | Paper |
| Cutwidth of Split Graphs and Threshold Graphs | 2012-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113683 | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113754 | 2012-01-23 | Paper |
| Planar k-Path in Subexponential Time and Polynomial Space | 2011-12-16 | Paper |
| Guard games on graphs: keep the intruder out! | 2011-12-07 | Paper |
| Bandwidth on AT-free graphs | 2011-12-07 | Paper |
| On the complexity of reconstructing H-free graphs from their Star Systems | 2011-10-12 | Paper |
| Feedback Vertex Set in Mixed Graphs | 2011-08-12 | Paper |
| An exact algorithm for minimum distortion embedding | 2011-07-14 | Paper |
| Tight Bounds for Linkages in Planar Graphs | 2011-07-06 | Paper |
| Clustering with Local Restrictions | 2011-07-06 | Paper |
| Ranking and Drawing in Subexponential Time | 2011-05-19 | Paper |
| A linear kernel for a planar connected dominating set | 2011-05-18 | Paper |
| On the complexity of some colorful problems parameterized by treewidth | 2011-02-21 | Paper |
| Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time | 2010-11-16 | Paper |
| Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs | 2010-11-16 | Paper |
| Intractability of Clique-Width Parameterizations | 2010-11-04 | Paper |
| Imbalance Is Fixed Parameter Tractable | 2010-07-20 | Paper |
| Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing | 2010-06-22 | Paper |
| Cops and Robber Game without Recharging | 2010-06-22 | Paper |
| Characterizing and computing minimal cograph completions | 2010-05-25 | Paper |
| On the complexity of computing treelength | 2010-05-25 | Paper |
| Guard Games on Graphs: Keep the Intruder Out! | 2010-05-11 | Paper |
| Finding the longest isometric cycle in a graph | 2010-04-28 | Paper |
| Sharp Separation and Applications to Exact and Parameterized Algorithms | 2010-04-27 | Paper |
| An Exact Algorithm for Minimum Distortion Embedding | 2010-01-21 | Paper |
| Planar Capacitated Dominating Set Is W[1-Hard] | 2010-01-14 | Paper |
| On the Directed Degree-Preserving Spanning Tree Problem | 2010-01-14 | Paper |
| Even Faster Algorithm for Set Splitting! | 2010-01-14 | Paper |
| Bandwidth on AT-Free Graphs | 2009-12-17 | Paper |
| Simpler Parameterized Algorithm for OCT | 2009-12-11 | Paper |
| The complexity ecology of parameters: An illustration using bounded max leaf number | 2009-10-19 | Paper |
| Fast FAST | 2009-07-14 | Paper |
| Incompressibility through Colors and IDs | 2009-07-14 | Paper |
| Distortion Is Fixed Parameter Tractable | 2009-07-14 | Paper |
| Linear Kernel for Planar Connected Dominating Set | 2009-06-03 | Paper |
| On the Complexity of Some Colorful Problems Parameterized by Treewidth | 2009-03-03 | Paper |
| Graph Layout Problems Parameterized by Vertex Cover | 2009-01-29 | Paper |
| Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs | 2009-01-20 | Paper |
| On the Complexity of Computing Treelength | 2008-09-17 | Paper |
| Characterizing and Computing Minimal Cograph Completions | 2008-06-19 | Paper |
| Capacitated Domination and Covering: A Parameterized Perspective | 2008-06-05 | Paper |
| Wheel-Free Deletion Is W[2-Hard] | 2008-06-05 | Paper |
| On the Complexity of Reconstructing H-free Graphs from Their Star Systems | 2008-04-15 | Paper |
| Optimal broadcast domination in polynomial time | 2006-12-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
