Planar graphs

Results: 475



#Item
1

The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)

Add to Reading List

Source URL: www.cs.bme.hu

Language: English - Date: 2016-06-02 14:02:15
    2

    Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org DETERMINISTICALLY ISOLATING A PERFECT MATCHING IN BIPARTITE PLANAR GRAPHS SAMIR DATTA 1 , RAGHAV KULKARNI 2 , AND SAMBU

    Add to Reading List

    Source URL: drops.dagstuhl.de

    Language: English - Date: 2008-02-05 05:27:58
      3

      Subexponential parameterized algorithms on planar graphs via low-treewidth pattern covering Dániel Marx (joint work with Fedor Fomin, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh)

      Add to Reading List

      Source URL: www.cs.bme.hu

      Language: English - Date: 2017-01-26 07:17:03
        4

        The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)

        Add to Reading List

        Source URL: www.cs.bme.hu

        Language: English - Date: 2015-11-06 12:09:41
          5

          Stars and bunches in planar graphs. Part II : General planar graphs and colourings ∗ O. V. Borodin,1 H. J. Broersma,2

          Add to Reading List

          Source URL: www.cdam.lse.ac.uk

          Language: English - Date: 2017-04-12 10:30:39
            6

            Jason J Molitierno* (), Department of Mathematics, Sacred Heart University, 5151 Park Avenue, Fairfield, CTOrdering maximal planar graphs by algebraic connectivity. G

            Add to Reading List

            Source URL: jointmathematicsmeetings.org

            Language: English - Date: 2013-09-19 00:48:35
              7

              Approximating the Diameter of Planar Graphs in Near Linear Time OREN WEIMANN and RAPHAEL YUSTER, University of Haifa We present a (1 + ε)-approximation algorithm running in O( f (ε) · n log4 n) time for finding the di

              Add to Reading List

              Source URL: www.cs.haifa.ac.il

              Language: English - Date: 2016-03-09 08:46:36
                8

                The k-disjoint paths problem in directed planar graphs Dániel Marx1 1 Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

                Add to Reading List

                Source URL: www.cs.bme.hu

                Language: English - Date: 2013-01-19 03:59:52
                  9

                  Planar Minimally Rigid Graphs and Pseudo-Triangulations Ruth Haas a , David Orden b,1 , G¨ unter Rote c,2 , Francisco Santos d,1 , Brigitte Servatius e , Herman Servatius e ,

                  Add to Reading List

                  Source URL: www.cs.tufts.edu

                  Language: English - Date: 2007-09-28 13:31:18
                    10

                    Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org THE ISOMORPHISM PROBLEM FOR PLANAR 3-CONNECTED GRAPHS IS IN UNAMBIGUOUS LOGSPACE THOMAS THIERAUF

                    Add to Reading List

                    Source URL: drops.dagstuhl.de

                    Language: English - Date: 2008-02-05 08:15:01
                      UPDATE