Results 1-20 of 49

Issue DateTitleTypeAuthor(s)
115-Nov-2021Compact cactus representations of all non-trivial min-cutsArticleLo, On-Hei Solomon ; Schmidt, Jens M.  ; Thorup, Mikkel 
229-Jun-2021Cycle spectra of contraction-critically 4-connected planar graphsArticleLo, On-Hei Solomon ; Schmidt, Jens M.  
3Jan-2021Fulltext availableOpen AccessCircumference of essentially 4-connected planar triangulationsArticleFabrici, Igor ; Harant, Jochen ; Mohr, Samuel ; Schmidt, Jens M.  
42021On short fastest paths in temporal graphsChapter/Article (Proceedings)Danda, Umesh Sandeep ; Ramakrishna, G. ; Schmidt, Jens M.  ; Srikanth, M. 
517-Jul-2020Computing vertex-disjoint paths in large graphs using MAOsArticlePreißer, Johanna E. ; Schmidt, Jens M.  
67-Feb-2020Fulltext availableOpen AccessShortness coefficient of cyclically 4-edge-connected cubic graphsArticleLo, On-Hei Solomon ; Schmidt, Jens M.  ; Van Cleemput, Nico ; Zamfirescu, Carol T. 
7Jan-2020On the circumference of essentially 4-connected planar graphsArticleFabrici, Igor ; Harant, Jochen ; Mohr, Samuel ; Schmidt, Jens M.  
82020Longer cycles in essentially 4-Connected planar graphsArticleFabrici, Igor ; Harant, Jochen ; Mohr, Samuel ; Schmidt, Jens M.  
915-May-2019Edge-OrdersArticleSchlipf, Lena ; Schmidt, Jens M.  
101-May-2019Simple computation of st-edge- and st-numberings from ear decompositionsArticleSchlipf, Lena ; Schmidt, Jens M.  
116-Dec-2018Computing vertex-disjoint paths in large graphs using MAOSChapter/Article (Proceedings)Preißer, Johanna E. ; Schmidt, Jens M.  
126-Dec-2018A cut tree representation for pendant pairsChapter/Article (Proceedings)Lo, On-Hei Solomon ; Schmidt, Jens M.  
131-Oct-2018More on foxesArticleKriesell, Matthias ; Schmidt, Jens M.  
144-Jul-2018Computing tutte pathsChapter/Article (Proceedings)Schmid, Andreas ; Schmidt, Jens M.  
15May-2018Tight bounds for the vertices of degree k in minimally k-connected graphsArticleSchmidt, Jens M.  
16May-2018Linear-time recognition of map graphs with outerplanar witnessArticleMnich, Matthias  ; Rutter, Ignaz ; Schmidt, Jens M.  
172018Computing 2-walks in polynomial timeArticleSchmid, Andreas ; Schmidt, Jens M.  
182018Longest cycles in cyclically 4-edge-connected cubic planar graphsArticleLo, On-Hei Solomon ; Schmidt, Jens M.  
197-Jul-2017Edge-ordersChapter/Article (Proceedings)Schlipf, Lena ; Schmidt, Jens M.  
202017Certifying 3-edge-connectivityArticleMehlhorn, Kurt ; Neumann, Adrian ; Schmidt, Jens M.