Informatik 14 - Lehrstuhl für Algorithmen und Komplexität

Filter
Konferenzbeitrag

Suchergebnisse

  • 2022

    Online Ad Allocation in Bounded-Degree Graphs

    Albers, S. & Schubert, S., 2022, Web and Internet Economics - 18th International Conference, WINE 2022, Proceedings. Hansen, K. A., Liu, T. X. & Malekian, A. (Hrsg.). Springer Science and Business Media Deutschland GmbH, S. 60-77 18 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 13778 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)

  • Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities

    Albers, S. & Schubert, S., 1 Sept. 2022, 30th Annual European Symposium on Algorithms, ESA 2022. Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; Band 244).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    3 Zitate (Scopus)
  • 2021

    Algorithms for Energy Conservation in Heterogeneous Data Centers

    Albers, S. & Quedenfeld, J., 2021, Algorithms and Complexity - 12th International Conference, CIAC 2021, Proceedings. Calamoneri, T. & Corò, F. (Hrsg.). Springer Science and Business Media Deutschland GmbH, S. 75-89 15 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 12701 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    1 Zitat (Scopus)

  • Algorithms for right-sizing heterogeneous data centers

    Albers, S. & Quedenfeld, J., 6 Juli 2021, SPAA 2021 - Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, S. 48-58 11 S. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    3 Zitate (Scopus)

  • Explorable Uncertainty in Scheduling with Non-uniform Testing Times

    Albers, S. & Eckl, A., 2021, Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Revised Selected Papers. Kaklamanis, C. & Levin, A. (Hrsg.). Springer Science and Business Media Deutschland GmbH, S. 127-142 16 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 12806 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    10 Zitate (Scopus)

  • Machine Covering in the Random-Order Model

    Albers, S., Gálvez, W. & Janke, M., 1 Dez. 2021, 32nd International Symposium on Algorithms and Computation, ISAAC 2021. Ahn, H.-K. & Sadakane, K. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 52. (Leibniz International Proceedings in Informatics, LIPIcs; Band 212).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)

  • Online Makespan Minimization with Budgeted Uncertainty

    Albers, S. & Janke, M., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (Hrsg.). Springer Science and Business Media Deutschland GmbH, S. 43-56 14 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 12808 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    3 Zitate (Scopus)

  • Optimal algorithms for online b-matching with variable vertex capacities

    Albers, S. & Schubert, S., 1 Sept. 2021, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021. Wootters, M. & Sanita, L. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs; Band 207).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    2 Zitate (Scopus)

  • Scheduling in the Secretary Model

    Albers, S. & Janke, M., 1 Dez. 2021, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021. Bojanczyk, M. & Chekuri, C. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6. (Leibniz International Proceedings in Informatics, LIPIcs; Band 213).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)

  • Scheduling with Testing on Multiple Identical Parallel Machines

    Albers, S. & Eckl, A., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (Hrsg.). Springer Science and Business Media Deutschland GmbH, S. 29-42 14 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 12808 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    6 Zitate (Scopus)
  • 2020

    Best fit bin packing with random order revisited

    Albers, S., Khan, A. & Ladewig, L., 1 Aug. 2020, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. Esparza, J., Kral�, D. & Kral�, D. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, MFCS-2020-7. (Leibniz International Proceedings in Informatics, LIPIcs; Band 170).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    2 Zitate (Scopus)

  • New bounds for randomized list update in the paid exchange model

    Albers, S. & Janke, M., März 2020, 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020. Paul, C. & Blaser, M. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, LIPIcs-STACS-2020-12. (Leibniz International Proceedings in Informatics, LIPIcs; Band 154).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    4 Zitate (Scopus)

  • Scheduling in the random-order model

    Albers, S. & Janke, M., 1 Juni 2020, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. Czumaj, A., Dawar, A. & Merelli, E. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 68. (Leibniz International Proceedings in Informatics, LIPIcs; Band 168).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    6 Zitate (Scopus)
  • 2019

    Improved online algorithms for knapsack and GAP in the random order model

    Albers, S., Khan, A. & Ladewig, L., Sept. 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 22. (Leibniz International Proceedings in Informatics, LIPIcs; Band 145).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    6 Zitate (Scopus)

  • New results for the k-secretary problem

    Albers, S. & Ladewig, L., Dez. 2019, 30th International Symposium on Algorithms and Computation, ISAAC 2019. Lu, P. & Zhang, G. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 18. (Leibniz International Proceedings in Informatics, LIPIcs; Band 149).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    3 Zitate (Scopus)
  • 2018

    Optimal algorithms for right-sizing data centers

    Albers, S. & Quedenfeld, J., 11 Juli 2018, SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, S. 363-372 10 S. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    19 Zitate (Scopus)
  • 2017

    On energy conservation in data centers

    Albers, S., 24 Juli 2017, SPAA 2017 - Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, S. 35-44 10 S. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; Band Part F129316).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    13 Zitate (Scopus)

  • On the value of penalties in time-inconsistent planning

    Albers, S. & Kraft, D., 1 Juli 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 10. (Leibniz International Proceedings in Informatics, LIPIcs; Band 80).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    6 Zitate (Scopus)

  • The price of uncertainty in present-biased planning

    Albers, S. & Kraft, D., 2017, Web and Internet Economics - 13th International Conference, WINE 2017, Proceedings. Devanur, N. R. & Lu, P. (Hrsg.). Springer Verlag, S. 325-339 15 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 10660 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    6 Zitate (Scopus)

  • Tight bounds for online coloring of basic graph classes

    Albers, S. & Schraink, S., 1 Sept. 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C., Sohler, C. & Pruhs, K. (Hrsg.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; Band 87).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)
  • 2016

    Motivating time-inconsistent agents: A computational approach

    Albers, S. & Kraft, D., 2016, Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings. Vetta, A. & Cai, Y. (Hrsg.). Springer Verlag, S. 309-323 15 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 10123 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    4 Zitate (Scopus)

  • Scheduling on power-heterogeneous processors

    Albers, S., Bampis, E., Letsios, D., Lucarelli, G. & Stotz, R., 2016, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Proceedings. Navarro, G., Kranakis, E. & Chávez, E. (Hrsg.). Springer Verlag, S. 41-54 14 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 9644).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    8 Zitate (Scopus)
  • 2015

    Quantifying competitiveness in paging with locality of reference

    Albers, S. & Frascaria, D., 2015, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Halldorsson, M. M., Kobayashi, N., Speckmann, B. & Iwama, K. (Hrsg.). Springer Verlag, S. 26-38 13 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 9134).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
  • 2014

    A framework for classical Petri net problems: Conservative Petri nets as an application

    Mayr, E. W. & Weihmann, J., 2014, Application and Theory of Petri Nets and Concurrency - 35th International Conference, PETRI NETS 2014, Proceedings. Springer Verlag, S. 314-333 20 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 8489 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    5 Zitate (Scopus)

  • Online makespan minimization with parallel schedules

    Albers, S. & Hellwig, M., 2014, Algorithm Theory, SWAT 2014 - 14th Scandinavian Symposium and Workshops, Proceedings. Springer Verlag, S. 13-25 13 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 8503 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    9 Zitate (Scopus)
  • 2013

    Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities

    Mayr, E. W. & Weihmann, J., 2013, Reachability Problems - 7th International Workshop, RP 2013, Proceedings. Springer Verlag, S. 209-221 13 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 8169 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    4 Zitate (Scopus)

  • Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets

    Mayr, E. W. & Weihmann, J., 2013, Application and Theory of Petri Nets and Concurrency - 34th International Conference, PETRI NETS 2013, Proceedings. S. 70-89 20 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 7927 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    5 Zitate (Scopus)
  • 2012

    Inequalities for the number of walks in graphs

    Hemmecke, R., Kosub, S., Mayr, E. W., Täubig, H. & Weihmann, J., 2012, 9th Meeting on Analytic Algorithmics and Combinatorics 2012, ANALCO 2012. Society for Industrial and Applied Mathematics Publications, S. 26-39 14 S. (9th Meeting on Analytic Algorithmics and Combinatorics 2012, ANALCO 2012).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    2 Zitate (Scopus)
  • 2011

    Space-efficient Gröbner basis computation without degree bounds

    Mayr, E. W. & Ritscher, S., 2011, ISSAC 2011 - Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation. S. 257-264 8 S. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    8 Zitate (Scopus)
  • 2010

    Degree bounds for Gröbner bases of low-dimensional polynomial ideals

    Mayr, E. W. & Ritscher, S., 2010, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010. Association for Computing Machinery (ACM), S. 21-27 7 S. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    10 Zitate (Scopus)
  • 2007

    Motion planning for 6R-Robots: Multiple tasks with constrained velocity and orientation of the end-effector

    Chibisov, D. & Mayr, E. W., 2007, SNC'07 - Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation. S. 72-78 7 S. (SNC'07 - Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • Stability investigation of a difference scheme for incompressible navier-stokes equations

    Chibisov, D., Ganzha, V., Mayr, E. W. & Vorozhtsov, E. V., 2007, Computer Algebra in Scientific Computing - 10th International Workshop, CASC 2007, Proceedings. Springer Verlag, S. 102-117 16 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 4770 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    2 Zitate (Scopus)
  • 2006

    On the provably tight approximation of optimal meshing for non-convex regions

    Chibisov, D., Ganzha, V., Mayr, E. W. & Vorozhtsov, E. V., 2006, Computer Algebra in Scientific Computing - 9th International Workshop, CASC 2006, Proceedings. Springer Verlag, S. 109-128 20 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 4194 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)

  • Spatial planning and geometric optimization: Combining configuration space and energy methods

    Chibisov, D., Mayr, E. W. & Pankratov, S., 2006, Automated Deduction in Geometry - 5th International Workshop, ADG 2004, Revised Papers. S. 156-168 13 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 3763 LNAI).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)
  • 2005

    Generation of orthogonal grids on curvilinear trimmed regions in constant time

    Chibisov, D., Ganzha, V., Mayr, E. W. & Vorozhtsov, E. V., 2005, Computer Algebra in Scientific Computing - 8th International Workshop, CASC 2005, Proceedings. S. 105-114 10 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 3718 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    3 Zitate (Scopus)
  • 2004

    Entwicklung eines Informationsportals für die Informatik

    Koschmider, A., Ley, M., Luksch, P., Maas, J., Mayr, E. W., Oberweis, A., Ortyl, P., Pfingstl, S., Rusnak, U., Sommer, D., Stucky, W. & Vollmar, R., 2004, 34. Jahrestagung der Gesellschaft fur Informatik, Informatik verbindet, INFORMATIK 2004 - Band 2. Dadam, P. & Reichert, M. (Hrsg.). Gesellschaft fur Informatik (GI), S. 208-212 5 S. (Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI); Band P-51).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • Exploring new frontiers of theoretical informatics: IFIP 18th World Computer Congress TC1 3rd International Conference on Theoretical Computer Science (TCS2004) 22-27 August 2004 Toulouse, France

    Levy, J. J., Mayr, E. W. & Mitchell, J. C., 2004, Exploring New Frontiers of Theoretical Informatics - IFIP 18th World Computer Congress TC1 and 3rd International Conference on Theoretical Computer Science, TCS 2004. Springer New York LLC, (IFIP Advances in Information and Communication Technology; Band 155).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • 2003

    Konzeption und Betrieb eines Kompetenz- und Dienstleistungsnetzes für die Informatik

    Horn, L., Ley, M., Luksch, P., Maas, J., Mayr, E. W., Oberweis, A., Ortyl, P., Pfingstl, S., Rossi, E., Rüssel, F., Rusnak, U., Sommer, D., Stucky, W., Vollmar, R. & von Mevius, M., 2003, 33. Jahrestagung der Gesellschaft fur Informatik, Innovative Informatikanwendungen, INFORMATIK 2003 - Band 1. Dittrich, K. R., Konig, W., Oberweis, A., Rannenberg, K. & Wahlster, W. (Hrsg.). Gesellschaft fur Informatik (GI), S. 132-147 16 S. (Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI); Band P-34).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)
  • 2002

    Complexity theory and algorithms

    Mayr, E. W., 2002, Euro-Par 2002 Parallel Processing - 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002 Proceedings. Monien, B. & Feldmann, R. (Hrsg.). Springer Verlag, S. 391 1 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 2400).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

  • 2000

    Distributed systems and algorithms

    Mayr, E. W., 2000, Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings. Bode, A., Ludwig, T., Karl, W. & Wismüller, R. (Hrsg.). Springer Verlag, S. 573-574 2 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1900).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access

  • It is on the boundary: Complexity considerations for polynomial ideals

    Mayr, E. W., 2000, Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - International Conference IFIP TCS 2000, Proceedings. van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P. D. & Ito, T. (Hrsg.). Springer Verlag, S. 99 1 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1872).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
  • 1998

    On-line scheduling of parallel jobs with runtime restrictions

    Bischof, S. & Mayr, E. W., 1998, Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. Springer Verlag, S. 119-129 11 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1533 LNCS).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    5 Zitate (Scopus)
  • 1997

    The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups

    Koppenhagen, U. & Mayr, E. W., 1997, Fundamentals of Computation Theory - 11th International Symposium, FCT 1997, Proceedings. Chlebus, B. S. & Czaja, L. (Hrsg.). Springer Verlag, S. 257-268 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1279).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    5 Zitate (Scopus)
  • 1996

    A general method for efficient embeddings of graphs into optimal hypercubes

    Heun, V. & Mayr, E. W., 1996, Euro-Par 1996 Parallel Processing - 2nd International Euro-Par Conference, Proceedings. Bouge, L., Fraigniaud, P., Mignotte, A., Robert, Y., Bouge, L., Fraigniaud, P., Mignotte, A. & Robert, Y. (Hrsg.). Springer Verlag, S. 222-233 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1123).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access
    2 Zitate (Scopus)

  • Efficient dynamic embedding of arbitrary binary trees into hypercubes

    Heun, V. & Mayr, E. W., 1996, Parallel Algorithms for Irregularly Structured Problems - 3rd International Workshop IRREGULAR 1996, Proceedings. Ferreira, A., Rolim, J., Saad, Y. & Yang, T. (Hrsg.). Springer Verlag, S. 287-298 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1117).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    16 Zitate (Scopus)

  • Efficient parallel algorithms for scheduling with tree precedence constraints

    Mayr, E. W. & Stadtherr, H., 1996, Euro-Par 1996 Parallel Processing - 2nd International Euro-Par Conference, Proceedings. Bouge, L., Fraigniaud, P., Mignotte, A. & Robert, Y. (Hrsg.). Springer Verlag, S. 543-554 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1124).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    Open Access

  • Embedding graphs with bounded treewidth into optimal hypercubes

    Heun, V. & Mayr, E. W., 1996, STACS 1996 - 13th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Puech, C. & Reischuk, R. (Hrsg.). Springer Verlag, S. 155-168 14 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1046).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    4 Zitate (Scopus)

  • Optimal gröbner base algorithms for binomial ideals

    Koppenhagen, U. & Mayr, E. W., 1996, Automata, Languages and Programming - 23rd International Colloquium, ICALP 1996, Proceedings. Meyer auf der Heide, F. & Monien, B. (Hrsg.). Springer Verlag, S. 244-255 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1099).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    2 Zitate (Scopus)
  • 1995

    Scheduling interval orders in parallel

    Mayr, E. W., 1995, Proceedings of the 28th Annual Hawaii International Conference on System Sciences, HICSS 1995. IEEE Computer Society, S. 20-28 9 S. 375481. (Proceedings of the Annual Hawaii International Conference on System Sciences; Band 2).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

    1 Zitat (Scopus)
  • 1994

    Optimal expression evaluation and term matching on the Boolean hypercube and on hypercubic networks

    Mayr, E. W. & Werchner, R., 1994, Proceedings of the Hawaii International Conference on System Sciences. Publ by IEEE, S. 140-149 10 S. (Proceedings of the Hawaii International Conference on System Sciences; Band 2).

    Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung