Showing 1 - 10 results of 10 for search '"Anna Lubiw"', query time: 0.09s Refine Results
  1. 1
    Token Swapping on Trees

    Token Swapping on Trees by Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte

    Published 2023-01-01
    Get full text
    Article
  2. 2
    A Generalization of the Source Unfolding of Convex Polyhedra

    A Generalization of the Source Unfolding of Convex Polyhedra by Demaine, Erik D., Lubiw, Anna

    Published 2014
    Get full text
    Get full text
    Article
  3. 3
    Refold rigidity of convex polyhedra

    Refold rigidity of convex polyhedra by Demaine, Erik D., Demaine, Martin L., Itoh, Jin-ichi, Lubiw, Anna, Nara, Chie, O'Rourke, Joseph

    Published 2015
    Get full text
    Get full text
    Article
  4. 4
    Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths

    Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths by Demaine, Erik D., Demaine, Martin L., Eppstein, David, Lubiw, Anna, Uehara, Ryuhei, Abel, Zachary Ryan

    Published 2015
    Get full text
    Get full text
    Get full text
    Article
  5. 5
    Folding a Paper Strip to Minimize Thickness

    Folding a Paper Strip to Minimize Thickness by Demaine, Erik D, Eppstein, David, Hesterberg, Adam, Ito, Hiro, Lubiw, Anna, Uehara, Ryuhei, Uno, Yushi

    Published 2019
    Get full text
    Article
  6. 6
    Continuously Flattening Polyhedra Using Straight Skeletons

    Continuously Flattening Polyhedra Using Straight Skeletons by Demaine, Erik D., Demaine, Martin L., Itoh, Jin-ichi, Lubiw, Anna, Nara, Chie, O'Rourke, Joseph, Abel, Zachary Ryan

    Published 2015
    Get full text
    Get full text
    Get full text
    Article
  7. 7
    Algorithms for Designing Pop-Up Cards

    Algorithms for Designing Pop-Up Cards by Abel, Zachary Ryan, Demaine, Erik D., Demaine, Martin L., Eisenstat, Sarah Charmian, Lubiw, Anna, Schulz, Andre, Souvaine, Diane L., Viglietta, Giovanni, Winslow, Andrew

    Published 2014
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8
    Simultaneous nearest neighbor search

    Simultaneous nearest neighbor search by Kleinberg, Robert, Yuan, Yang, Indyk, Piotr, Mahabadi, Sepideh

    Published 2017
    Get full text
    Get full text
    Get full text
    Article
  9. 9
    Who Needs Crossings? Hardness of Plane Graph Rigidity

    Who Needs Crossings? Hardness of Plane Graph Rigidity by Abel, Zachary R, Demaine, Erik D, Demaine, Martin L, Eisenstat, Sarah Charmian, Lynch, Jayson R., Schardl, Tao Benjamin

    Published 2017
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10
    Binary matrix factorisations under Boolean arithmetic

    Binary matrix factorisations under Boolean arithmetic by Kovács, RA

    Published 2023
    “…</p> <br> <p>In Part I. of this thesis, we continue Anna Lubiw's study of firm matrices. <strong>X</strong> is said to be firm if <em><strong>i</em></strong>(<strong>X</strong>)=<em><strong>br</em></strong>(<strong>X</strong>) and this equality holds for all its submatrices. …”
    Thesis

Search Tools: