Jens M. Schmidt
Title
Cited by
Cited by
Year
What makes a resource valuable? Identifying the drivers of firm-idiosyncratic resource value
J Schmidt, T Keil
Academy of Management Review 38 (2), 206-228, 2013
2072013
A simple test on 2-vertex-and 2-edge-connectivity
JM Schmidt
Information Processing Letters 113 (7), 241-244, 2013
742013
Effective search in rugged performance landscapes: A review and outlook
O Baumann, J Schmidt, N Stieglitz
Journal of Management 45 (1), 285-318, 2019
322019
Customer‐specific synergies and market convergence
J Schmidt, R Makadok, T Keil
Strategic Management Journal 37 (5), 870-895, 2016
302016
Largest inscribed rectangles in convex polygons
C Knauer, L Schlipf, JM Schmidt, HR Tiwary
Journal of discrete algorithms 13, 78-85, 2012
262012
Largest Inscribed Rectangles in Convex Polygons
C Knauer, L Schlipf, JM Schmidt, HR Tiwary
EuroCG'10, 2010
262010
Certifying 3-edge-connectivity
K Mehlhorn, A Neumann, JM Schmidt
Graph-Theoretic Concepts in Computer Science (WG 2013), 358-369, 2013
21*2013
Construction sequences and certifying 3-connectedness
JM Schmidt
Symposium on Theoretical Aspects of Computer Science (STACS'10), 2010
172010
Efficient extraction of multiple Kuratowski subdivisions
M Chimani, P Mutzel, JM Schmidt
Graph Drawing (GD'07), 159-170, 2008
172008
Artificial indoor streams as a method to investigate the impact of chemicals on lotic communities
D Jungmann, K Brust, O Licht, J Mählmann, J Schmidt, R Nagel
Environmental Science and Pollution Research 8 (1), 49-55, 2001
172001
Contractions, removals, and certifying 3-connectivity in linear time
JM Schmidt
SIAM Journal on Computing 42 (2), 494-535, 2013
152013
Structure and constructions of 3-connected graphs
JM Schmidt
152011
Structure and constructions of 3-connected graphs
JM Schmidt
152011
The Mondshein sequence
JM Schmidt
International Colloquium on Automata, Languages, and Programming, 967-978, 2014
142014
Interval stabbing problems in small integer ranges
JM Schmidt
Algorithms and Computation (ISAAC'09), 163-172, 2009
142009
Every DFS tree of a 3‐connected graph contains a contractible edge
A Elmasry, K Mehlhorn, JM Schmidt
Journal of Graph Theory 72 (1), 112-121, 2013
92013
An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
A Elmasry, K Mehlhorn, JM Schmidt
Algorithmica 62 (3-4), 754-766, 2012
92012
Computing tutte paths
A Schmid, JM Schmidt
arXiv preprint arXiv:1707.05994, 2017
72017
A new high-pressure laboratory setup for the investigation of deep-sea oil spill scenarios under in-situ conditions
R Seemann, K Malone, K Laqua, J Schmidt, A Meyer, D Krause, ...
Proceedings of the seventh International Symposium on Environmental …, 2014
72014
Construction sequences and certifying 3-connectivity
JM Schmidt
Algorithmica 62 (1), 192-208, 2012
62012
The system can't perform the operation now. Try again later.
Articles 1–20