✦ LIBER ✦

Two-Phase Stefan Problems. Recent Results and Open Questions

✍ Scribed by Sandro Salsa

Book ID: 118062952
Publisher: SP Birkhäuser Verlag Basel
Year: 2012
Tongue: English
Weight: 273 KB
Volume: 80
Category: Article
ISSN: 1424-9286
DOI: 10.1007/s00032-012-0180-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cortical encoding of pitch: Recent resul

Cortical encoding of pitch: Recent results and open questions

✍ Kerry M.M. Walker; Jennifer K. Bizley; Andrew J. King; Jan W.H. Schnupp 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 723 KB

Regularity results for a one-dimensional

Regularity results for a one-dimensional two-phase degenerate Stefan problem

✍ Xiangsheng Xu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 753 KB

Point vortex dynamics: recent results an

Point vortex dynamics: recent results and open problems

✍ Hassan Aref; James B. Kadtke; Ireneusz Zawadzki; Laurence J. Campbell; Bruno Eck 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 836 KB

An existence result for a two-phase Stef

An existence result for a two-phase Stefan problem arising in metal casting

✍ A. Bermúdez; M. V. Otero 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

## Abstract We present a model arising from the thermal modelling of two metal casting processes. We consider an enthalpy formulation for this two‐phase Stefan problem in a time varying three‐dimensional domain and consider convective heat transfer in the liquid phase. Then, we introduce a weak for

A survey: Recent results, conjectures, a

A survey: Recent results, conjectures, and open problems in labeling graphs

✍ Joseph A. Gallian 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 752 KB

In this paper we organize and summarize much of the work done on graceful and harmonious labelings of graphs. Many open problems and conjectures are included.

The end structure of a graph: recent res

The end structure of a graph: recent results and open problems

✍ Reinhard Diestel 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1022 KB

This paper aims to give a brief introduction to a set of problems, old and new, concerned with one of the main and long-standing quests in infinite graph theory: how to represent the end structure of a given graph by that of a simpler subgraph, in particular a spanning tree. There has been a fair am