Borgwardt, Steffen; Grewe, Weston; Kafer, Sean; Lee, Jon; Sanità, Laura On the Hardness of Short and Sign-Compatible Circuit Walks. arXiv:2402.01066 Preprint, arXiv:2402.01066 [math.OC] (2024). MSC: 52B05 68Q25 90C60 BibTeX Cite \textit{S. Borgwardt} et al., ``On the Hardness of Short and Sign-Compatible Circuit Walks'', Preprint, arXiv:2402.01066 [math.OC] (2024) Full Text: arXiv OA License
Borgwardt, Stefan; Forkel, Walter; Kovtunova, Alisa Temporal minimal-world query answering over sparse ABoxes. (English) Zbl 07776340 Theory Pract. Log. Program. 22, No. 2, 193-228 (2022). MSC: 68T30 68T27 PDFBibTeX XMLCite \textit{S. Borgwardt} et al., Theory Pract. Log. Program. 22, No. 2, 193--228 (2022; Zbl 07776340) Full Text: DOI arXiv OA License
Alrabbaa, Christian; Baader, Franz; Borgwardt, Stefan; Dachselt, Raimund; Koopmann, Patrick; Méndez, Julián Evonne: interactive proof visualization for description logics (system description). (English) Zbl 07628192 Blanchette, Jasmin (ed.) et al., Automated reasoning. 11th international joint conference, IJCAR 2022, Haifa, Israel, August 8–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13385, 271-280 (2022). MSC: 68V15 PDFBibTeX XMLCite \textit{C. Alrabbaa} et al., Lect. Notes Comput. Sci. 13385, 271--280 (2022; Zbl 07628192) Full Text: DOI arXiv
Borgwardt, Steffen; Brand, Cornelius; Feldmann, Andreas Emil; Koutecký, Martin A note on the approximability of deepest-descent circuit steps. (English) Zbl 1525.90261 Oper. Res. Lett. 49, No. 3, 310-315 (2021). MSC: 90C05 90C60 90C10 PDFBibTeX XMLCite \textit{S. Borgwardt} et al., Oper. Res. Lett. 49, No. 3, 310--315 (2021; Zbl 1525.90261) Full Text: DOI arXiv
Alrabbaa, Christian; Baader, Franz; Borgwardt, Stefan; Koopmann, Patrick; Kovtunova, Alisa Finding good proofs for description logic entailments using recursive quality measures. (English) Zbl 07437085 Platzer, André (ed.) et al., Automated deduction – CADE 28. 28th international conference on automated deduction, virtual event, July 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12699, 291-308 (2021). MSC: 03B35 68V15 PDFBibTeX XMLCite \textit{C. Alrabbaa} et al., Lect. Notes Comput. Sci. 12699, 291--308 (2021; Zbl 07437085) Full Text: DOI arXiv
Horn, Max; De Brouwer, Edward; Moor, Michael; Moreau, Yves; Rieck, Bastian; Borgwardt, Karsten Topological Graph Neural Networks. arXiv:2102.07835 Preprint, arXiv:2102.07835 [cs.LG] (2021). BibTeX Cite \textit{M. Horn} et al., ``Topological Graph Neural Networks'', Preprint, arXiv:2102.07835 [cs.LG] (2021) Full Text: arXiv OA License
Borgwardt, Karsten; Ghisu, Elisabetta; Llinares-López, Felipe; O’Bray, Leslie; Rieck, Bastian Graph kernels: state-of-the-art and future challenges. (English) Zbl 1461.68174 Found. Trends Mach. Learn. 13, No. 5-6, 1-189 (2020). MSC: 68T05 62H30 68R10 68-02 PDFBibTeX XMLCite \textit{K. Borgwardt} et al., Found. Trends Mach. Learn. 13, No. 5--6, 1--189 (2020; Zbl 1461.68174) Full Text: DOI arXiv
Baader, Franz; Borgwardt, Stefan; Koopmann, Patrick; Ozaki, Ana; Thost, Veronika Metric temporal description logics with interval-rigid names. (English) Zbl 1446.68145 ACM Trans. Comput. Log. 21, No. 4, Article No. 30, 46 p. (2020). MSC: 68T27 03B44 68Q17 68T30 PDFBibTeX XMLCite \textit{F. Baader} et al., ACM Trans. Comput. Log. 21, No. 4, Article No. 30, 46 p. (2020; Zbl 1446.68145) Full Text: DOI
Rieck, Bastian; Yates, Tristan; Bock, Christian; Borgwardt, Karsten; Wolf, Guy; Turk-Browne, Nicholas; Krishnaswamy, Smita Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence. arXiv:2006.07882 Preprint, arXiv:2006.07882 [q-bio.NC] (2020). BibTeX Cite \textit{B. Rieck} et al., ``Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence'', Preprint, arXiv:2006.07882 [q-bio.NC] (2020) Full Text: arXiv OA License
Borgwardt, Karsten (ed.); Loh, Po-Ling (ed.); Terzi, Evimaria (ed.); Ukkonen, Antti (ed.) Introduction to the special issue for the ECML PKDD 2019 journal track. (English) Zbl 1458.68004 Data Min. Knowl. Discov. 33, No. 5, 1223-1224 (2019). MSC: 68-06 62-06 62H30 68T05 00B25 PDFBibTeX XMLCite \textit{K. Borgwardt} (ed.) et al., Data Min. Knowl. Discov. 33, No. 5, 1223--1224 (2019; Zbl 1458.68004) Full Text: DOI
Borgwardt, Karsten (ed.); Loh, Po-Ling (ed.); Terzi, Evimaria (ed.); Ukkonen, Antti (ed.) Introduction to the special issue for the ECML PKDD 2019 journal track. (English) Zbl 1422.00015 Mach. Learn. 108, No. 8-9, 1191-1192 (2019). MSC: 00B25 68-06 68T05 PDFBibTeX XMLCite \textit{K. Borgwardt} (ed.) et al., Mach. Learn. 108, No. 8--9, 1191--1192 (2019; Zbl 1422.00015) Full Text: DOI
Moor, Michael; Horn, Max; Rieck, Bastian; Borgwardt, Karsten Topological Autoencoders. arXiv:1906.00722 Preprint, arXiv:1906.00722 [cs.LG] (2019). BibTeX Cite \textit{M. Moor} et al., ``Topological Autoencoders'', Preprint, arXiv:1906.00722 [cs.LG] (2019) Full Text: arXiv OA License
Rieck, Bastian; Togninalli, Matteo; Bock, Christian; Moor, Michael; Horn, Max; Gumbsch, Thomas; Borgwardt, Karsten Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology. arXiv:1812.09764 Preprint, arXiv:1812.09764 [cs.LG] (2018). BibTeX Cite \textit{B. Rieck} et al., ``Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology'', Preprint, arXiv:1812.09764 [cs.LG] (2018) Full Text: DOI arXiv OA License
Baader, Franz; Borgwardt, Stefan; Koopmann, Patrick; Ozaki, Ana; Thost, Veronika Metric temporal description logics with interval-rigid names. (English) Zbl 1495.68204 Dixon, Clare (ed.) et al., Frontiers of combining systems. 11th international symposium, FroCoS 2017, Brasília, Brazil, September 27–29, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10483, 60-76 (2017). MSC: 68T27 03B44 68T30 PDFBibTeX XMLCite \textit{F. Baader} et al., Lect. Notes Comput. Sci. 10483, 60--76 (2017; Zbl 1495.68204) Full Text: DOI
Göhl, Markus; Borgwardt, Karl Heinz The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model. (English) Zbl 1311.90070 Math. Methods Oper. Res. 80, No. 3, 329-366 (2014). Reviewer: Marcin Anholcer (Poznan) MSC: 90C05 60D05 68Q25 68W40 PDFBibTeX XMLCite \textit{M. Göhl} and \textit{K. H. Borgwardt}, Math. Methods Oper. Res. 80, No. 3, 329--366 (2014; Zbl 1311.90070) Full Text: DOI Link
Borgwardt, Karl Heinz How fast does the simplex method usually work? Or: the search for (stochastic) independence. (Wie schnell arbeitet das Simplexverfahren normalerweise? Oder: Das Streben nach (stochastischer) Unabhängigkeit.) (German) Zbl 1323.90036 Mitt. Dtsch. Math.-Ver. 22, No. 2, 80-92 (2014). Reviewer: Antanas Žilinskas (Vilnius) MSC: 90C05 PDFBibTeX XMLCite \textit{K. H. Borgwardt}, Mitt. Dtsch. Math.-Ver. 22, No. 2, 80--92 (2014; Zbl 1323.90036) Full Text: DOI
Song, Le; Smola, Alex; Gretton, Arthur; Bedo, Justin; Borgwardt, Karsten Feature selection via dependence maximization. (English) Zbl 1303.68110 J. Mach. Learn. Res. 13, 1393-1434 (2012). MSC: 68T05 62F07 62H30 62H20 PDFBibTeX XMLCite \textit{L. Song} et al., J. Mach. Learn. Res. 13, 1393--1434 (2012; Zbl 1303.68110) Full Text: Link
Gretton, Arthur; Borgwardt, Karsten M.; Rasch, Malte J.; Schölkopf, Bernhard; Smola, Alexander A kernel two-sample test. (English) Zbl 1283.62095 J. Mach. Learn. Res. 13, 723-773 (2012). MSC: 62G10 62G08 60F10 PDFBibTeX XMLCite \textit{A. Gretton} et al., J. Mach. Learn. Res. 13, 723--773 (2012; Zbl 1283.62095) Full Text: Link
Shervashidze, Nino; Schweitzer, Pascal; van Leeuwen, Erik Jan; Mehlhorn, Kurt; Borgwardt, Karsten M. Weisfeiler-Lehman graph kernels. (English) Zbl 1280.68194 J. Mach. Learn. Res. 12, 2539-2561 (2011). MSC: 68T05 62H30 05C90 PDFBibTeX XMLCite \textit{N. Shervashidze} et al., J. Mach. Learn. Res. 12, 2539--2561 (2011; Zbl 1280.68194) Full Text: Link
Thoma, Marisa; Cheng, Hong; Gretton, Arthur; Han, Jiawei; Kriegel, Hans-peter; Smola, Alex; Song, Le; Yu, Philip S.; Yan, Xifeng; Borgwardt, Karsten M. Discriminative frequent subgraph mining with optimality guarantees. (English) Zbl 07260252 Stat. Anal. Data Min. 3, No. 5, 302-318 (2010). MSC: 62-XX 68-XX PDFBibTeX XMLCite \textit{M. Thoma} et al., Stat. Anal. Data Min. 3, No. 5, 302--318 (2010; Zbl 07260252) Full Text: DOI
Vishwanathan, S. V. N.; Schraudolph, Nicol N.; Kondor, Risi; Borgwardt, Karsten M. Graph kernels. (English) Zbl 1242.05112 J. Mach. Learn. Res. 11, 1201-1242 (2010). MSC: 05C20 15A09 60G50 PDFBibTeX XMLCite \textit{S. V. N. Vishwanathan} et al., J. Mach. Learn. Res. 11, 1201--1242 (2010; Zbl 1242.05112) Full Text: Link
Fleischmann, Bernhard (ed.); Borgwardt, Karl Heinz (ed.); Klein, Robert (ed.); Tuma, Axel (ed.) Operations research proceedings 2008. Selected papers of the annual international conference of the German Operations Research Society (GOR), University of Augsburg, September 3–5, 2008. (English) Zbl 1175.90010 Berlin: Springer (ISBN 978-3-642-00141-3/pbk; 978-3-642-00142-0/ebook). xx, 580 p. (2009). MSC: 90-06 00B25 PDFBibTeX XMLCite \textit{B. Fleischmann} (ed.) et al., Operations research proceedings 2008. Selected papers of the annual international conference of the German Operations Research Society (GOR), University of Augsburg, September 3--5, 2008. Berlin: Springer (2009; Zbl 1175.90010) Full Text: DOI
Borgwardt, Karl Heinz Average-case analysis of the double description method and the beneath-beyond algorithm. (English) Zbl 1115.68155 Discrete Comput. Geom. 37, No. 2, 175-204 (2007). MSC: 68U05 52A99 90C05 PDFBibTeX XMLCite \textit{K. H. Borgwardt}, Discrete Comput. Geom. 37, No. 2, 175--204 (2007; Zbl 1115.68155) Full Text: DOI
Huhn, Petra; Borgwardt, Karl Heinz Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (English) Zbl 1046.90040 J. Complexity 18, No. 3, 833-910 (2002). Reviewer: R. N. Kaul (Delhi) MSC: 90C05 PDFBibTeX XMLCite \textit{P. Huhn} and \textit{K. H. Borgwardt}, J. Complexity 18, No. 3, 833--910 (2002; Zbl 1046.90040) Full Text: DOI Link
Borgwardt, Karl Heinz Optimization, operations research, game theory. Mathematical foundations. (Optimierung, Operations Research, Spieltheorie.) (German) Zbl 0963.90001 Basel: Birkhäuser. xx, 622 S. (2001). Reviewer: Roland Fahrion (Heidelberg) MSC: 90-01 91-01 90Cxx 91Axx 90C05 90C10 90C30 90C25 00A05 00A06 PDFBibTeX XMLCite \textit{K. H. Borgwardt}, Optimierung, Operations Research, Spieltheorie. Basel: Birkhäuser (2001; Zbl 0963.90001)
Borgwardt, K. H. Erratum: “A sharp upper bound for the expected number of shadow vertices in LP-polyhedra under orthogonal projection on two-dimensional planes”. (English) Zbl 0977.90020 Math. Oper. Res. 24, No. 4, 925-984 (1999). MSC: 90C05 90C57 52A22 90C60 PDFBibTeX XMLCite \textit{K. H. Borgwardt}, Math. Oper. Res. 24, No. 4, 925--984 (1999; Zbl 0977.90020) Full Text: DOI
Borgwardt, Karl Heinz; Huhn, Petra A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm. (English) Zbl 0949.90059 Math. Methods Oper. Res. 49, No. 2, 175-210 (1999). Reviewer: Istvan Maros (London) MSC: 90C05 90C60 68Q25 PDFBibTeX XMLCite \textit{K. H. Borgwardt} and \textit{P. Huhn}, Math. Methods Oper. Res. 49, No. 2, 175--210 (1999; Zbl 0949.90059) Full Text: DOI
Borgwardt, Karl Heinz A sharp upper bound for the expected number of shadow vertices in LP-polyhedra under orthogonal projection on two-dimensional planes. (English) Zbl 0967.90079 Math. Oper. Res. 24, No. 3, 544-603 (1999). Reviewer: Yoshio Ohtsubo (Kochi) MSC: 90C05 90C60 60D05 90C57 52A22 52B12 90C08 PDFBibTeX XMLCite \textit{K. H. Borgwardt}, Math. Oper. Res. 24, No. 3, 544--603 (1999; Zbl 0967.90079) Full Text: DOI Link
Borgwardt, K. H. Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points. (English) Zbl 0876.68052 Discrete Comput. Geom. 17, No. 1, 79-109 (1997). MSC: 68W10 52A22 60D05 PDFBibTeX XMLCite \textit{K. H. Borgwardt}, Discrete Comput. Geom. 17, No. 1, 79--109 (1997; Zbl 0876.68052) Full Text: DOI
Borgwardt, K. H. Sharpening of the polynomiality proof for the expected numbers of shadow corners in the rotation symmetry model. (Verschärfung des Polynomialitätsbeweises für die erwartete Anzahl von Schattenecken im Rotationssymmetrie-Modell.) (German) Zbl 0810.90090 Schock, Eberhard (ed.), Beiträge zur Angewandten Analysis und Informatik. Helmut Brakhage zu Ehren. Aachen: Shaker Verlag. Berichte aus der Mathematik. 13-33 (1994). MSC: 90C05 90C60 PDFBibTeX XMLCite \textit{K. H. Borgwardt}, in: Beiträge zur Angewandten Analysis und Informatik. Helmut Brakhage zu Ehren. Aachen: Shaker Verlag. 13--33 (1994; Zbl 0810.90090)
Borgwardt, Karl Heinz; Brzank, Jürgen Average saving effects in enumerative methods for solving knapsack problems. (English) Zbl 0798.90106 J. Complexity 10, No. 1, 129-141 (1994). MSC: 90C09 90C60 PDFBibTeX XMLCite \textit{K. H. Borgwardt} and \textit{J. Brzank}, J. Complexity 10, No. 1, 129--141 (1994; Zbl 0798.90106) Full Text: DOI
Borgwardt, Karl Heinz; Damm, Renate; Donig, Rudolf; Joas, Gabriele Empirical studies on the average efficiency of simplex variants under rotation symmetry. (English) Zbl 0789.90052 ORSA J. Comput. 5, No. 3, 249-260 (1993). MSC: 90C05 90-08 PDFBibTeX XMLCite \textit{K. H. Borgwardt} et al., ORSA J. Comput. 5, No. 3, 249--260 (1993; Zbl 0789.90052) Full Text: DOI
Borgwardt, K. H.; Tremel, B. The average quality of greedy-algorithms for the subset-sum-maximization problem. (English) Zbl 0729.90063 Z. Oper. Res. 35, No. 2, 113-149 (1991). Reviewer: I.Martinec (Praha) MSC: 90C09 90-08 68Q25 90C60 PDFBibTeX XMLCite \textit{K. H. Borgwardt} and \textit{B. Tremel}, Z. Oper. Res. 35, No. 2, 113--149 (1991; Zbl 0729.90063) Full Text: DOI
Borgwardt, Karl Heinz; Gaffke, Norbert; Jünger, Michael; Reinelt, Gerhard Computing the convex hull in the Euclidean plane in linear expected time. (English) Zbl 0741.68096 Applied geometry and discrete mathematics, Festschr. 65th Birthday Victor Klee, DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 4, 91-107 (1991). Reviewer: F.Aurenhammer (Graz) MSC: 68U05 60D05 PDFBibTeX XMLCite \textit{K. H. Borgwardt} et al., in: A dual forest algorithm for the assignment problem. . 91--107 (1991; Zbl 0741.68096)
Borgwardt, Karl Heinz Probabilistic analysis of the simplex method. (English) Zbl 0725.90059 Mathematical developments arising from linear programming, Proc. AMS-IMS- SIAM Jt. Summer Res. Conf., Brunswick/ME (USA) 1988, Contemp. Math. 114, 21-34 (1990). MSC: 90C05 90C60 90-08 PDFBibTeX XML
Borgwardt, K. H. Probabilistic analysis of optimization algorithms - some aspects from a practical point of view. (English) Zbl 0634.90042 Acta Appl. Math. 10, 171-210 (1987). MSC: 90C05 90C10 68Q25 90C27 65K05 PDFBibTeX XMLCite \textit{K. H. Borgwardt}, Acta Appl. Math. 10, 171--210 (1987; Zbl 0634.90042)
Borgwardt, Karl Heinz The simplex method. A probabilistic analysis. (English) Zbl 0604.90092 Algorithms and Combinatorics, 1. Berlin etc.: Springer-Verlag. XI, 268 p. DM 68.00 (1987). Reviewer: K.G.Murty MSC: 90C05 90-02 49-02 68Q25 65K05 PDFBibTeX XML
Borgwardt, Karl Heinz Der durchschnittliche Rechenaufwand beim Simplexverfahren. (German) Zbl 0563.90069 Operations research, Proc. 13th Annu. Meet., St. Gallen/Switz. 1984, 647-660 (1985). MSC: 90C05 65K05 68Q25 52A22 68W99 60D05 PDFBibTeX XML
Borgwardt, Karl-Heinz Some distribution-independent results about the asymptotic order of the average number of pivot steps of the simplex method. (English) Zbl 0498.90054 Math. Oper. Res. 7, 441-462 (1982). MSC: 90C05 65K05 68Q25 PDFBibTeX XMLCite \textit{K.-H. Borgwardt}, Math. Oper. Res. 7, 441--462 (1982; Zbl 0498.90054) Full Text: DOI
Borgwardt, K.-H. The average number of pivot steps required by the simplex-method is polynomial. (English) Zbl 0488.90047 Z. Oper. Res., Ser. A 26, 157-177 (1982). MSC: 90C05 68Q25 PDFBibTeX XMLCite \textit{K. H. Borgwardt}, Z. Oper. Res., Ser. A 26, 157--177 (1982; Zbl 0488.90047) Full Text: DOI
Borgwardt, Karl-Heinz The expected number of pivot steps required by a certain variant of the simplex method is polynomial. (English) Zbl 0505.90043 Methods Oper. Res. 43, 35-41 (1981). MSC: 90C05 65K05 68Q25 PDFBibTeX XMLCite \textit{K.-H. Borgwardt}, Methods Oper. Res. 43, 35--41 (1981; Zbl 0505.90043)
Borgwardt, Karl-Heinz Die asymptotische Ordnung der mittleren Schrittzahl von Simplexverfahren. (German) Zbl 0459.90045 Methods Oper. Res. 37, 81-95 (1980). MSC: 90C05 65K05 68Q25 PDFBibTeX XMLCite \textit{K.-H. Borgwardt}, Methods Oper. Res. 37, 81--95 (1980; Zbl 0459.90045)
Borgwardt, Karl-Heinz Some distribution-independent results about the asymptotic order of the average number of pivot steps of the simplex-method. (English) Zbl 0451.90081 Prepr., Univ. Kaiserslautern, Fachbereich Math. 4, 27 p. (1979). MSC: 90C05 68Q25 PDFBibTeX XML
Borgwardt, Karl-Heinz Zum Rechenaufwand von Simplexverfahren. (German) Zbl 0407.90053 Oper. Res.-Verf. 31, 83-97 (1979). MSC: 90C05 68Q60 68Q25 PDFBibTeX XMLCite \textit{K.-H. Borgwardt}, Oper. Res.-Verf. 31, 83--97 (1979; Zbl 0407.90053)
Borgwardt, Karl-Heinz Untersuchungen zur Asymptotik der mittleren Schrittzahl von Simplexverfahren in der linearen Optimierung. (German) Zbl 0386.90043 Oper. Res. Verf. 28, 2nd Symp. Oper. Res., Teil 1, Aachen 1977, 332-345 (1978). MSC: 90C05 65K05 68Q25 PDFBibTeX XML
Borgwardt, Karl-Heinz Untersuchungen zur Asymptotik der mittleren Schrittzahl von Simplexverfahren in der linearen Optimierung. (German) Zbl 0416.90041 Fachbereich Mathematik der Universität Kaiserslautern. 109 S. (1977). MSC: 90C05 65K05 68Q25 90C15 68Q60 PDFBibTeX XML