default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Ruzika
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j43]Nils Hausbrandt
, Oliver Bachtler, Stefan Ruzika, Luca E. Schäfer:
Parametric matroid interdiction. Discret. Optim. 51: 100823 (2024)- [j42]Stephan Helfrich, Kathrin Prinz, Stefan Ruzika:
The Weighted p-Norm Weight Set Decomposition for Multiobjective Discrete Optimization Problems. J. Optim. Theory Appl. 202(3): 1187-1216 (2024) - [j41]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
Approximating multiobjective optimization problems: How exact can you be? Math. Methods Oper. Res. 100(1): 5-25 (2024) - [j40]Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory. Math. Methods Oper. Res. 100(1): 27-63 (2024) - [j39]Kathrin Kennel, Stefan Ruzika:
Real-time Prediction of Students' Math Difficulties using Raw Data from Eye Tracking and Neural Networks. Proc. ACM Hum. Comput. Interact. 8(ETRA): 1-19 (2024) - [j38]Steffen Steinert, Karina E. Avila, Stefan Ruzika, Jochen Kuhn, Stefan Küchemann:
Harnessing large language models to develop research-based learning assistants for formative feedback. Smart Learn. Environ. 11(1): 62 (2024) - [i21]Steffen Steinert, Lars Krupp, Karina E. Avila, Anke S. Janssen, Verena Ruf, David Dzsotjan, Christian de Schryver, Jakob Karolus, Stefan Ruzika, Karen Joisten, Paul Lukowicz, Jochen Kuhn, Norbert Wehn, Stefan Küchemann:
Lessons Learned from Designing an Open-Source Automated Feedback System for STEM Education. CoRR abs/2401.10531 (2024) - 2023
- [j37]Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen:
Approximating biobjective minimization problems using general ordering cones. J. Glob. Optim. 86(2): 393-415 (2023) - [j36]Stephan Helfrich, Tyler A. Perini, Pascal Halffmann, Natashia Boland, Stefan Ruzika:
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems. J. Glob. Optim. 86(2): 417-440 (2023) - [c18]Lynn Knippertz, Anna L. Münz, Stefan Ruzika:
Automated Detection of Geometric Structures in Gaze Data. ETRA 2023: 34:1-34:2 - [i20]Lena Leiß, Till Heller, Luca E. Schäfer, Manuel Streicher, Stefan Ruzika:
p-median location interdiction on trees. CoRR abs/2301.13723 (2023) - [i19]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
Approximating Multiobjective Optimization Problems: How exact can you be? CoRR abs/2305.15142 (2023) - [i18]Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory. CoRR abs/2305.15173 (2023) - 2022
- [j35]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
An approximation algorithm for a general class of parametric optimization problems. J. Comb. Optim. 43(5): 1328-1358 (2022) - [j34]Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
An approximation algorithm for a general class of multi-parametric optimization problems. J. Comb. Optim. 44(3): 1459-1494 (2022) - [j33]Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. Theory Comput. Syst. 66(1): 395-415 (2022) - [j32]Karl-Heinz Küfer, Kaisa Miettinen, Stefan Ruzika, Serpil Sayin:
Multi-criteria optimization in industry. OR Spectr. 44(2): 303-305 (2022) - [c17]André Greubel, Hans-Stefan Siller, Stefan Ruzika, Lynn Knippertz:
Teaching Mathematical Modeling with Computing Technology: Presentation of a Course based on Evacuations. WiPSCE 2022: 12:1-12:6 - [i17]Philipp Herrmann, Anna Meyer, Stefan Ruzika, Luca E. Schäfer, Fabian von der Warth:
A machine learning based algorithm selection method to solve the minimum cost flow problem. CoRR abs/2210.02195 (2022) - 2021
- [j31]Luca E. Schäfer, Tobias Dietz, Maria Barbati, José Rui Figueira, Salvatore Greco, Stefan Ruzika:
The binary knapsack problem with qualitative levels. Eur. J. Oper. Res. 289(2): 508-514 (2021) - [j30]Arne Herzel, Stefan Ruzika, Clemens Thielen:
Approximation Methods for Multiobjective Optimization Problems: A Survey. INFORMS J. Comput. 33(4): 1284-1299 (2021) - [j29]Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
One-exact approximate Pareto sets. J. Glob. Optim. 80(1): 87-115 (2021) - [j28]Nicolas Fröhlich, Stefan Ruzika:
On the hardness of covering-interdiction problems. Theor. Comput. Sci. 871: 1-15 (2021) - [i16]Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen:
Approximating Biobjective Minimization Problems Using General Ordering Cones. CoRR abs/2109.10067 (2021) - [i15]Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems. CoRR abs/2109.10076 (2021) - 2020
- [j27]Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika:
Sparsifying parity-check matrices. Appl. Soft Comput. 96: 106601 (2020) - [j26]Thomas Ullmert, Stefan Ruzika, Anita Schöbel:
On the p-hub interdiction problem. Comput. Oper. Res. 124: 105056 (2020) - [j25]Tobias Dietz, Kathrin Klamroth, Konstantin Kraus, Stefan Ruzika, Luca E. Schäfer, Britta Schulze, Michael Stiglmayr, Margaret M. Wiecek:
Introducing multiobjective complex systems. Eur. J. Oper. Res. 280(2): 581-596 (2020) - [j24]Luca E. Schäfer, Tobias Dietz, Nicolas Fröhlich, Stefan Ruzika, José Rui Figueira:
Shortest paths with ordinal weights. Eur. J. Oper. Res. 280(3): 1160-1170 (2020) - [j23]Pascal Halffmann, Tobias Dietz, Anthony Przybylski, Stefan Ruzika:
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem. J. Glob. Optim. 77(4): 715-742 (2020) - [j22]Britta Schulze, Michael Stiglmayr, Luís Paquete, Carlos M. Fonseca, David Willems, Stefan Ruzika:
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem. Math. Methods Oper. Res. 92(1): 107-132 (2020) - [j21]Florian Gensheimer, Tobias Dietz, Kira Kraft, Stefan Ruzika, Norbert Wehn:
A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding. IEEE Trans. Inf. Theory 66(8): 4819-4833 (2020) - [i14]Luca E. Schäfer, Tobias Dietz, Maria Barbati, José Rui Figueira, Salvatore Greco, Stefan Ruzika:
The {0, 1}-knapsack problem with qualitative levels. CoRR abs/2002.04850 (2020) - [i13]Simon Busan, Luca E. Schäfer, Stefan Ruzika:
The two player shortest path network interdiction problem. CoRR abs/2004.08338 (2020) - [i12]Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika:
Sparsifying Parity-Check Matrices. CoRR abs/2005.05051 (2020) - [i11]Luca E. Schäfer, Stefan Ruzika, Sven O. Krumke, Carlos M. Fonseca:
On the Bicriterion Maximum Flow Network Interdiction Problem. CoRR abs/2010.02730 (2020)
2010 – 2019
- 2019
- [c16]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
An FPTAS for a General Class of Parametric Optimization Problems. COCOON 2019: 25-37 - [c15]Luca E. Schäfer, Tobias Dietz, Marco V. Natale, Stefan Ruzika, Sven O. Krumke, Carlos M. Fonseca:
The Bicriterion Maximum Flow Network Interdiction Problem in s-t-Planar Graphs. OR 2019: 133-139 - [i10]Florian Gensheimer, Tobias Dietz, Kira Kraft, Stefan Ruzika, Norbert Wehn:
A Reduced-Complexity Projection Algorithm for ADMM-based LP Decoding. CoRR abs/1901.03240 (2019) - [i9]Luca E. Schäfer, Andrea Maier, Stefan Ruzika:
On the Universal Near-Shortest Simple Paths Problem. CoRR abs/1906.05101 (2019) - [i8]Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. CoRR abs/1908.01181 (2019) - [i7]Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
One-Exact Approximate Pareto Sets. CoRR abs/1908.10561 (2019) - 2018
- [c14]Florian Gensheimer, Tobias Dietz, Stefan Ruzika, Kira Kraft, Norbert Wehn:
Improved Maximum-Likelihood Decoding Using Sparse Parity-Check Matrices. ICT 2018: 236-240 - [c13]Florian Gensheimer, Tobias Dietz, Stefan Ruzika, Kira Kraft, Norbert Wehn:
A Low-Complexity Projection Algorithm for ADMM-Based LP Decoding. ISTC 2018: 1-5 - [i6]Luca E. Schäfer, Tobias Dietz, Nicolas Fröhlich, Stefan Ruzika, José Rui Figueira:
Shortest Paths with Ordinal Weights. CoRR abs/1808.09410 (2018) - 2017
- [j20]Alberto Giudici, Pascal Halffmann, Stefan Ruzika, Clemens Thielen:
Approximation schemes for the parametric knapsack problem. Inf. Process. Lett. 120: 11-15 (2017) - [j19]Tobias Kuhn, Stefan Ruzika:
A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions. J. Glob. Optim. 67(3): 581-600 (2017) - [j18]Carolin Torchiani, Jan Ohst, David Willems, Stefan Ruzika:
Shortest Paths with Shortest Detours - A Biobjective Routing Problem. J. Optim. Theory Appl. 174(3): 858-874 (2017) - [j17]Pascal Halffmann, Stefan Ruzika, Clemens Thielen, David Willems:
A general approximation method for bicriteria minimization problems. Theor. Comput. Sci. 695: 1-15 (2017) - [c12]David Willems, Oliver Zehner, Stefan Ruzika:
On a Technique for Finding Running Tracks of Specific Length in a Road Network. OR 2017: 333-338 - [i5]Pascal Halffmann, Stefan Ruzika, Clemens Thielen, David Willems:
A General Approximation Method for Bicriteria Minimization Problems. CoRR abs/1701.02989 (2017) - 2016
- [j16]Tobias Kuhn, Carlos M. Fonseca, Luís Paquete, Stefan Ruzika, Miguel Duarte, José Rui Figueira:
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms. Evol. Comput. 24(3): 411-425 (2016) - [j15]Simone Göttlich, Sebastian Kühn, Jan Peter Ohst, Stefan Ruzika:
Evacuation modeling: a case study on linear and nonlinear network flow models. EURO J. Comput. Optim. 4(3-4): 219-239 (2016) - [c11]Florian Gensheimer, Stefan Ruzika, Stefan Scholl, Norbert Wehn:
ADMM versus simplex algorithm for LP decoding. ISTC 2016: 211-215 - 2014
- [c10]Michael Helmling, Eirik Rosnes, Stefan Ruzika, Stefan Scholl:
Efficient maximum-likelihood decoding of linear block codes on binary memoryless channels. ISIT 2014: 2589-2593 - [c9]Florian Gensheimer, Stefan Ruzika, Stefan Scholl, Norbert Wehn:
A simplex algorithm for LP decoding hardware. PIMRC 2014: 790-794 - [i4]Michael Helmling, Eirik Rosnes, Stefan Ruzika, Stefan Scholl:
Efficient Maximum-Likelihood Decoding of Linear Block Codes on Binary Memoryless Channels. CoRR abs/1403.4118 (2014) - 2013
- [j14]Thomas Vincent, Florian Seipp, Stefan Ruzika, Anthony Przybylski, Xavier Gandibleux:
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case. Comput. Oper. Res. 40(1): 498-509 (2013) - [c8]Michael Helmling, Stefan Ruzika:
Towards combinatorial LP turbo decoding. ISIT 2013: 1491-1495 - [i3]Michael Helmling, Stefan Ruzika:
Towards An Exact Combinatorial Algorithm for LP Decoding of Turbo Codes. CoRR abs/1301.6363 (2013) - 2012
- [j13]Christian Klamler, Ulrich Pferschy, Stefan Ruzika:
Committee selection under weight constraints. Math. Soc. Sci. 64(1): 48-56 (2012) - [j12]Stefan Ruzika, Markus Thiemann:
Min-Max quickest path problems. Networks 60(4): 253-258 (2012) - [j11]Jochen Gorski, Kathrin Klamroth, Stefan Ruzika:
Generalized multiple objective bottleneck problems. Oper. Res. Lett. 40(4): 276-281 (2012) - [j10]Michael Helmling, Stefan Ruzika, Akin Tanatmis:
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms. IEEE Trans. Inf. Theory 58(7): 4753-4769 (2012) - [c7]Stefan Scholl, Frank Kienle, Michael Helmling, Stefan Ruzika:
ML vs. BP decoding of binary and non-binary LDPC codes. ISTC 2012: 71-75 - 2011
- [j9]Jochen Gorski, Kathrin Klamroth, Stefan Ruzika:
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization. J. Optim. Theory Appl. 150(3): 475-497 (2011) - [j8]Stefan Ruzika, Heike Sperber, Mechthild Steiner:
Earliest arrival flows on series-parallel graphs. Networks 57(2): 169-173 (2011) - [j7]Simone Göttlich, Sebastian Kühn, Jan Peter Ohst, Stefan Ruzika, Markus Thiemann:
Evacuation dynamics influenced by spreading hazardous material. Networks Heterog. Media 6(3): 443-464 (2011) - [c6]Kathrin Leiner, Stefan Ruzika:
Quickest Cluster Flow Problems on Tree Networks. INOC 2011: 243-255 - [c5]Stefan Ruzika, Markus Thiemann:
Reliable and Restricted Quickest Path Problems. INOC 2011: 309-314 - [i2]Michael Helmling, Stefan Ruzika, Akin Tanatmis:
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithm. CoRR abs/1107.3715 (2011) - 2010
- [j6]Akin Tanatmis, Stefan Ruzika, Horst W. Hamacher, Mayur Punekar, Frank Kienle, Norbert Wehn:
A separation algorithm for improved LP-decoding of linear block codes. IEEE Trans. Inf. Theory 56(7): 3277-3289 (2010) - [c4]Akin Tanatmis, Stefan Ruzika, Mayur Punekar, Frank Kienle:
Numerical Comparison of IP Formulations as ML Decoders. ICC 2010: 1-5
2000 – 2009
- 2009
- [j5]Jochen Gorski, Stefan Ruzika:
On k-max-optimization. Oper. Res. Lett. 37(1): 23-26 (2009) - [c3]Christian Klamler, Ulrich Pferschy, Stefan Ruzika:
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. ADT 2009: 50-61 - [c2]Stefan Ruzika, Horst W. Hamacher:
A Survey on Multiple Objective Minimum Spanning Tree Problems. Algorithmics of Large and Complex Networks 2009: 104-116 - [c1]Stefan Ruzika, Akin Tanatmis, Frank Kienle, Horst W. Hamacher, Norbert Wehn, Mayur Punekar:
Valid inequalities for binary linear codes. ISIT 2009: 2216-2220 - 2008
- [i1]Akin Tanatmis, Stefan Ruzika, Horst W. Hamacher, Mayur Punekar, Frank Kienle, Norbert Wehn:
A Separation Algorithm for Improved LP-Decoding of Linear Block Codes. CoRR abs/0812.2559 (2008) - 2007
- [j4]Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika:
Multiple objective minimum cost flow problems: A review. Eur. J. Oper. Res. 176(3): 1404-1422 (2007) - [j3]Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika:
Finding representative systems for discrete bicriterion optimization problems. Oper. Res. Lett. 35(3): 336-344 (2007) - 2006
- [j2]Horst W. Hamacher, Stefan Ruzika, Stevanus A. Tjandra:
Algorithms for time-dependent bicriteria shortest path problems. Discret. Optim. 3(3): 238-254 (2006) - [j1]Stefan Ruzika:
An Exact Algorithm for Solving Weight-Constrained Combinatorial Optimization Problems. Electron. Notes Discret. Math. 25: 143-144 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-26 23:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
