Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Robust modeling of probabilistic uncertainty in smart Grids: Data ambiguous Chance Constrained Optimum Power Flow.

D. Bienstock, M. Chertkov, and S. Harnett. CDC, page 4335-4340. IEEE, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel Holder University of Stuttgart

Laser micromachining of bionic transport structures on cemented tungsten carbide for passive directional transport of lubricantsD. Holder, N. Kessenbrock, K. Cirakoglu, C. Hagenlocher, and T. Graf. 123, page 452–457. Elsevier BV, (2024)

Dr. -Ing. Daniel Markthaler University of Stuttgart

Replication Data for: Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesisN. Hansen, and D. Markthaler. Dataset, (2024)Related to: Schneider, Andreas; Lystbæk, Thomas B.; Markthaler, Daniel; Hansen, Niels; Hauer, Bernhard (2024): Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesis. In: Nature Communications, 15, 4925. doi: 10.1038/s41467-024-48993-9.

Univ. -Prof. Dr. Daniel Weiskopf University of Stuttgart

Supplemental Materials for: Visual Analysis of Fitness Landscapes in Architectural Design OptimizationM. Abdelaal, M. Galuschka, M. Zorn, F. Kannenberg, A. Menges, T. Wortmann, D. Weiskopf, and K. Kurzhals. Software, (2024)Related to: Manuscript accepted for publication in the Visual Computer journal.

Daniel Marino

Daniel Roth

Other publications of authors with the same name

A Lot-Sizing Problem on Trees, Related to Network Design.D. Bienstock. IPCO, page 421-434. Carnegie Mellon University, (1992)Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey).D. Bienstock. Reliability Of Computer And Communication Networks, volume 5 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 33-50. DIMACS/AMS, (1989)Non-Stationary Streaming PCA.D. Bienstock, A. Shukla, and S. Yun. CoRR, (2019)Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming.D. Bienstock, J. Sethuraman, and C. Ye. CoRR, (2013)A Note on Polynomial Solvability of the CDT Problem.D. Bienstock. SIAM Journal on Optimization, 26 (1): 488-498 (2016)ATM Network Design: Traffic Models and Optimization-Based Heuristics.D. Bienstock, and I. Saniee. Telecommunication Systems, 16 (3-4): 399-421 (2001)Monotonicity in Graph Searching.D. Bienstock, and P. Seymour. J. Algorithms, 12 (2): 239-245 (1991)On obstructions to small face covers in planar graphs.D. Bienstock, and N. Dean. J. Comb. Theory, Ser. B, 55 (2): 163-189 (1992)On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures.D. Bienstock, and C. Monma. Algorithmica, 5 (1): 93-109 (1990)Optimal control of cascading power grid failures.D. Bienstock. CDC-ECE, page 2166-2173. IEEE, (2011)