Luitpold Babel

From MaRDI portal
Revision as of 23:08, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Luitpold Babel to Luitpold Babel: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:190504

Available identifiers

zbMath Open babel.luitpoldMaRDI QIDQ190504

List of research outcomes





PublicationDate of PublicationType
A new characterization of \(P_4\)-connected graphs2024-06-05Paper
On the isomorphism of graphs with few P4s2024-02-28Paper
Directed path graph isomorphism2024-01-05Paper
Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles2018-05-30Paper
Trajectory planning for unmanned aerial vehicles: a network optimization approach2013-02-20Paper
Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. II. Program Implementation of the Weisfeiler-Leman Algorithm2010-02-09Paper
Algorithms for on-line bin-packing problems with cardinality constraints2004-11-23Paper
Design of tariff zones in public transportation networks: theoretical results and heuristics2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44741342004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45333732002-09-26Paper
Efficient algorithms for graphs with few \(P_4\)'s2001-07-18Paper
https://portal.mardi4nfdi.de/entity/Q27144022001-06-13Paper
Tree-like \(P_4\)-connected graphs2000-11-02Paper
Recognition and isomorphism of tree-like \(P_4\)-connected graphs2000-04-26Paper
On the \(p\)-connectedness of graphs---a survey1999-12-12Paper
Triangulating graphs with few \(P_4\)'s1999-11-29Paper
The \(k\)-partitioning problem1999-08-22Paper
Recognizing the \(P_4\)-structure of bipartite graphs1999-08-02Paper
https://portal.mardi4nfdi.de/entity/Q42328001999-04-26Paper
On the structure of graphs with few \(P_4\)s1998-10-18Paper
https://portal.mardi4nfdi.de/entity/Q43736671998-02-16Paper
https://portal.mardi4nfdi.de/entity/Q43736681998-01-21Paper
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs1996-12-08Paper
Isomorphism of chordal (6, 3) graphs1995-10-08Paper
Hard-to-color graphs for connected sequential colorings1995-01-26Paper
A fast algorithm for the maximum weight clique problem1994-03-14Paper
Finding maximum cliques in arbitrary and in special graphs1991-01-01Paper
A branch and bound algorithm for the maximum clique problem1990-01-01Paper

Research outcomes over time

This page was built for person: Luitpold Babel

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:190504&oldid=10459957"
Powered by MediaWiki