Planar cover

Results: 21



#Item
1CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   LOCALLY INJECTIVE HOMOMORPHISMS

CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   LOCALLY INJECTIVE HOMOMORPHISMS

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2013-09-27 02:52:02
2Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:22
3Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis

Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-01-12 16:30:06
4Planar Vertex Cover [Lichtensteinvariable clause

Planar Vertex Cover [Lichtensteinvariable clause

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2014-10-05 18:37:08
    5Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime

    Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime

    Add to Reading List

    Source URL: www.zaik.uni-koeln.de

    Language: English - Date: 2014-02-20 07:20:59
    6REV A  I/O Cover Rear Vent

    REV A I/O Cover Rear Vent

    Add to Reading List

    Source URL: www.runco.com

    Language: English
    7REV A  I/O Cover Rear Vent

    REV A I/O Cover Rear Vent

    Add to Reading List

    Source URL: www.runco.com

    Language: English
    8CCCG 2011, Toronto ON, August 10–12, 2011  Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

    CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

    Add to Reading List

    Source URL: www.cccg.ca

    Language: English - Date: 2011-08-06 04:11:13
    9CCCG 2011, Toronto ON, August 10–12, 2011  Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

    CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

    Add to Reading List

    Source URL: 2011.cccg.ca

    Language: English - Date: 2011-08-06 04:11:13
    10Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow

    Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow

    Add to Reading List

    Source URL: www.mrfellows.net

    Language: English - Date: 2009-10-05 20:16:31