PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "van Leeuwen, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
Structure of Polynomial-Time Approximation.

, and . Theory Comput. Syst., 50 (4): 641-674 (2012)

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.

Univ. -Prof. Dr. Joris van Slageren University of Stuttgart

Electrocatalytic proton reduction: Metal based fused diporphyrins with proton relays for efficient catalysis, , , , , , , , and . Dataset, (2024)Related to: Chandra, S., Singha Hazari, A., Song, Q., Hunger, D., Neuman, N. I., van Slageren, J., Klemm, E. & Sarkar, B. (2023). Remarkable Enhancement of Catalytic Activity of Cu-Complexes in the Electrochemical Hydrogen Evolution Reaction by Using Triply Fused Porphyrin. ChemSusChem 16, e202201146. doi: 10.1002/cssc.202201146.

Tim Janz University of Stuttgart

PD Dr. phil. Frank Janle University of Stuttgart

Benedikt Janny

Isabel Janowsky University of Stuttgart

 

Other publications of authors with the same name

Integer Representations of Convex Polygon Intersection Graphs., , and . SIAM J. Discrete Math., 27 (1): 205-231 (2013)Structure of Polynomial-Time Approximation., and . Theory Comput. Syst., 50 (4): 641-674 (2012)Integer representations of convex polygon intersection graphs., , and . Symposium on Computational Geometry, page 300-307. ACM, (2011)Convex Polygon Intersection Graphs., and . Graph Drawing, volume 6502 of Lecture Notes in Computer Science, page 377-388. Springer, (2010)Uniform d-emulations of rings, with an application to distributed virtual ring construction., and . Networks, 23 (4): 237-248 (1993)The Complexity of Interval Routing on Random Graphs., , and . MFCS, volume 969 of Lecture Notes in Computer Science, page 37-49. Springer, (1995)Maintenance of Transitive Closures and Transitive Reductions of Graphs., and . WG, volume 314 of Lecture Notes in Computer Science, page 106-120. Springer, (1987)Emergence of a Super-Turing Computational Potential in Artificial Living Systems., and . ECAL, volume 2159 of Lecture Notes in Computer Science, page 55-65. Springer, (2001)Name Resolution by Rewriting in Dynamic Networks of Mobile Entities., and . Rainbow of Computer Science, volume 6570 of Lecture Notes in Computer Science, page 215-227. Springer, (2011)Worst-case Analysis of Set Union Algorithms., and . J. ACM, 31 (2): 245-281 (1984)