Dr. Arne Leitert

Senior Lecturer

Central Washington University

Affiliations

Computer Science

Dr. Arne Leitert is currently serving as a Computer Science Senior Lecturer at Central Washington University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Dr. Arne Leitert

Central Washington University

Senior Lecturer

You can click a keyword to filter the displayed items

graph theory computer science computational science extremal graph theory applied mathematics computational geometry theoretical computer science combinatorial optimization structural graph theory chordal graphs mathematics theory of computation network analysis network science clustering computational optimization mathematical optimization control optimization automatic control numerical simulations scientific computing combinatorial theory discrete algorithms numerical algorithms logic in computer science computational number theory computability theory vehicle routing problems computational complexity theory path planning graph analysis graph sparsity graph drawing algebraic graph theory knot theory hypergraph theory at-free graphs polynomial-time algorithms injective hulls various graph classes mathematical programming web search information visualization cluster computing data integration granular computing knowledge discovery data science databases global networks relation (philosophy) data mining automated deduction automated reasoning informatics computational mathematics combinatorics natural computing computational complexity discrete mathematics semantic web data and information visualization polyhedron knowledge graphs set theory systematics (systems theory) memetic computing information retrieval mathematical logic knowledge-based systems pure mathematics

Notable Scholarly Works

Notable Federal Grants

Collaborators

Injective Hulls of Various Graph Classes. Graphs and Combinatorics (2022)

Heather M. GuarneraFeodor F. DraganArne Leitert

injective hullsgraph theorycombinatoricsvarious graph classes

Equivalence Between Pathbreadth and Strong Pathbreadth. Discrete Applied Mathematics (2019)

3-Colouring for Dually Chordal Graphs and Generalisations. Information Processing Letters (2017)

Arne Leitert

extremal graph theoryalgebraic graph theoryinformation sciencestructural graph theorygraph theorycomputational sciencecomputational complexitycombinatorial theorychordal graphsgeometry and topologyknot theorycombinatorial optimizationdiscrete algorithmscomputer sciencehypergraph theory

On the Minimum Eccentricity Shortest Path Problem. Theoretical Computer Science (2017)

Feodor F. DraganArne Leitert

computational number theorycomputational optimizationtheory of computationcomputational geometrymathematical optimizationgraph theorycomputational sciencecontrol optimizationcomputability theorytheoretical computer sciencevehicle routing problemsautomatic controlnumerical simulationsapplied mathematicscomputational complexity theorycomputer sciencemathematicspath planning

Tree-Breadth of Graphs With Variants and Applications. OhioLink ETD Center (Ohio Library and Information Network) (2017)

On Strong Tree-Breadth. Lecture notes in computer science (2016)

Arne LeitertFeodor F. Dragan

extremal graph theorynumerical algorithmsnumerical analysiscomputational geometrygraph theorycomputational sciencelogic in computer sciencetheoretical computer sciencecombinatorial optimizationcomputer science

Line-Distortion, Bandwidth and Path-Length of a Graph. Algorithmica (2015)

Feodor F. DraganEkkehard KöhlerArne Leitert

scientific computingextremal graph theorynetwork analysisstructural graph theorygraph theorycomputational sciencegraph analysisnetwork sciencegraph sparsityapplied mathematicsclusteringgraph drawingcomputer science

Polynomial-Time Algorithms for Weighted Efficient Domination Problems in At-Free Graphs and Dually Chordal Graphs. Information Processing Letters (2014)

Andreas BrandstädtPavel FičurArne LeitertMartin Milanič

at-free graphsgraph theorypolynomial-time algorithmschordal graphs

Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. arXiv (Cornell University) (2012)