651 citations
- Bielefeld UniversityDE17 papers
- Hochschule OsnabrückDE14 papers
- University of StuttgartDE12 papers
- Forschungszentrum JülichDE7 papers
- Technische Universität BraunschweigDE7 papers
- German Research Centre for Artificial IntelligenceDE5 papers
- Iowa State UniversityUS5 papers
- University Hospital MagdeburgDE5 papers
- University of GroningenNL5 papers
- Ames National LaboratoryUS4 papers
- Charles UniversityCZ4 papers
- Leipzig UniversityDE4 papers
6 papers · 1 filter
Real-time broadening of non-equilibrium density profiles and the role of the specific initial-state realization
R. Steinigeweg, F. Jin, D. Schmidtke +3
The real-time broadening of density profiles starting from non-equilibrium states is at the center of transport in condensed-matter systems and dynamics in ultracold atomic gases.…
A remark on regularity of powers and products of ideals
Winfried Bruns, Aldo Conca
New title and minor adjustments. To appear in the Journal of Pure and Applied Algebra
High-temperature expansion for frustrated magnets: Application to the J1-J2 model on the BCC lattice
Johannes Richter, Patrick Müller, Andre Lohmann +1
We present the high-temperature expansion up to 11th order for the specific heat and the uniform susceptibility and up to 9th order for the structure factor o…
Placing Arrows in Directed Graph Drawings
Carla Binucci, Markus Chimani, Walter Didimo +2
We consider the problem of placing arrow heads in directed graph drawings without them overlapping other drawn objects. This gives drawings where edge directions can be deduced una…
A Note on the Practicality of Maximal Planar Subgraph Algorithms
Markus Chimani, Karsten Klein, Tilo Wiedera
Given a graph , the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of with the maximum number of edges. There are several heuristic, approximative,…
A Productivity Checker for Logic Programming
E. Komendantskaya, P. Johann, M. Schmidt
Automated analysis of recursive derivations in logic programming is known to be a hard problem. Both termination and non-termination are undecidable problems in Turing-complete lan…