يعرض 1 - 20 نتائج من 84 نتيجة بحث عن '"Grüttemeier, Niels"', وقت الاستعلام: 0.49s تنقيح النتائج
  1. 1
    Report
    Parameterized Local Search for Max $c$-Cut

    المؤلفون: Garvardt, Jaroslav, Grüttemeier, Niels, Komusiewicz, Christian, Morawietz, Nils

    مصطلحات موضوعية: Computer Science - Computational Complexity

    URL الوصول: http://arxiv.org/abs/2409.13380

    View record in Arxiv

    أضف إلى المفضلة
  2. 2
    Report
    Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times

    المؤلفون: Balzereit, Kaja, Grüttemeier, Niels, Morawietz, Nils, Reinhardt, Dennis, Windmann, Stefan, Wolf, Petra

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity

    URL الوصول: http://arxiv.org/abs/2409.00771

    View record in Arxiv

    أضف إلى المفضلة
  3. 3
    Report
    Security Decisions for Cyber-Physical Systems based on Solving Critical Node Problems with Vulnerable Nodes

    المؤلفون: Otto, Jens, Grüttemeier, Niels, Specht, Felix

    مصطلحات موضوعية: Computer Science - Cryptography and Security, Computer Science - Artificial Intelligence

    URL الوصول: http://arxiv.org/abs/2406.10287

    View record in Arxiv

    أضف إلى المفضلة
  4. 4
    Report
    Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs

    المؤلفون: Grüttemeier, Niels, Keßler, Philipp Heinrich, Komusiewicz, Christian, Sommer, Frank

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms

    URL الوصول: http://arxiv.org/abs/2211.01701

    View record in Arxiv

    أضف إلى المفضلة
  5. 5
    Report
    Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings

    المؤلفون: Grüttemeier, Niels, Komusiewicz, Christian, Morawietz, Nils

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, Computer Science - Machine Learning

    URL الوصول: http://arxiv.org/abs/2204.02902

    View record in Arxiv

    أضف إلى المفضلة
  6. 6
    Report
    Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs

    المؤلفون: Arrighi, Emmanuel, Grüttemeier, Niels, Morawietz, Nils, Sommer, Frank, Wolf, Petra

    مصطلحات موضوعية: Computer Science - Computational Complexity, 68Q17, 68Q27, 05C83, 05C85

    URL الوصول: http://arxiv.org/abs/2203.07401

    View record in Arxiv

    أضف إلى المفضلة
  7. 7
    Report
    Preventing Small $\mathbf{(s,t)}$-Cuts by Protecting Edges

    المؤلفون: Grüttemeier, Niels, Komusiewicz, Christian, Morawietz, Nils, Sommer, Frank

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics

    URL الوصول: http://arxiv.org/abs/2107.04482

    View record in Arxiv

    أضف إلى المفضلة
  8. 8
    Report
    On the Parameterized Complexity of Polytree Learning

    المؤلفون: Grüttemeier, Niels, Komusiewicz, Christian, Morawietz, Nils

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, Computer Science - Machine Learning

    URL الوصول: http://arxiv.org/abs/2105.09675

    View record in Arxiv

    أضف إلى المفضلة
  9. 9
    Report
    Destroying Multicolored Paths and Cycles in Edge-Colored Graphs

    المؤلفون: Eckstein, Nils Jakob, Grüttemeier, Niels, Komusiewicz, Christian, Sommer, Frank

    المصدر: Discrete Mathematics & Theoretical Computer Science, vol. 25:1, Graph Theory (March 3, 2023) dmtcs:7636

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, Mathematics - Combinatorics

    URL الوصول: http://arxiv.org/abs/2104.03138

    View record in Arxiv

    أضف إلى المفضلة
  10. 10
    Report
    Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis

    المؤلفون: Grüttemeier, Niels, Komusiewicz, Christian

    المصدر: Journal of Artificial Intelligence Research (JAIR), 74:1225-1267, 2022

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, Computer Science - Machine Learning

    URL الوصول: http://arxiv.org/abs/2004.14724

    View record in Arxiv

    أضف إلى المفضلة
  11. 11
    Academic Journal
    On Critical Node Problems with Vulnerable Vertices

    المؤلفون: Schestag, Jannik Theodor, Grüttemeier, Niels, Komusiewicz, Christian, Sommer, Frank

    مصطلحات موضوعية: graph connectivity, vertex deletion, social networks

    وصف الملف: application/pdf

    Relation: Journal of graph algorithms and applications; https://publica.fraunhofer.de/handle/publica/470319; https://doi.org/10.24406/publica-3269

    الاتاحة: https://publica.fraunhofer.de/handle/publica/470319
    https://doi.org/10.7155/jgaa.v28i1.2922
    https://doi.org/10.24406/publica-3269

    View record in BASE Full Text Finder

    أضف إلى المفضلة
  12. 12
    Report
    Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs

    المؤلفون: Grüttemeier, Niels, Komusiewicz, Christian, Morawietz, Nils

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, Mathematics - Combinatorics

    URL الوصول: http://arxiv.org/abs/2002.08659

    View record in Arxiv

    أضف إلى المفضلة
  13. 13
    Report
    Destroying Bicolored $P_3$s by Deleting Few Edges

    المؤلفون: Grüttemeier, Niels, Komusiewicz, Christian, Schestag, Jannik, Sommer, Frank

    المصدر: Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 1, Graph Theory (June 8, 2021) dmtcs:6108

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, Mathematics - Combinatorics

    URL الوصول: http://arxiv.org/abs/1901.03627

    View record in Arxiv

    أضف إلى المفضلة
  14. 14
    Report
    Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors

    المؤلفون: Bulteau, Laurent, Grüttemeier, Niels, Komusiewicz, Christian, Sorge, Manuel

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics

    URL الوصول: http://arxiv.org/abs/1811.09411

    View record in Arxiv

    أضف إلى المفضلة
  15. 15
    Report
    On the Relation of Strong Triadic Closure and Cluster Deletion

    المؤلفون: Grüttemeier, Niels, Komusiewicz, Christian

    مصطلحات موضوعية: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics

    URL الوصول: http://arxiv.org/abs/1803.00807

    View record in Arxiv

    أضف إلى المفضلة
  16. 16
    Conference
    A Graph-Theoretic Formulation of Exploratory Blockmodeling

    المؤلفون: Bille, A., Grüttemeier, Niels, Komusiewicz, C., Morawietz, N.

    مصطلحات موضوعية: Branch-And-Bound, Clustering, Exact Algorithms, ILP-Formulation, Social Networks

    وصف الملف: application/pdf

    Relation: International Symposium on Experimental Algorithms 2023; #PLACEHOLDER_PARENT_METADATA_VALUE#; 21st International Symposium on Experimental Algorithms, SEA 2023; undefined; https://publica.fraunhofer.de/handle/publica/452278; https://doi.org/10.24406/publica-2081

    الاتاحة: https://publica.fraunhofer.de/handle/publica/452278
    https://doi.org/10.4230/LIPIcs.SEA.2023.14
    https://doi.org/10.24406/publica-2081

    View record in BASE

    أضف إلى المفضلة
  17. 17
    Academic Journal
    Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs.

    المؤلفون: Grüttemeier, Niels, Keßler, Philipp Heinrich, Komusiewicz, Christian, Sommer, Frank

    المصدر: Journal of Combinatorial Optimization; Oct2024, Vol. 48 Issue 3, p1-27, 27p


    أضف إلى المفضلة
  18. 18
    Academic Journal
    Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs

    المؤلفون: Morawietz, Nils, Grüttemeier, Niels, Komusiewicz, Christian, Sommer, Frank

    المساهمون: Deutsche Forschungsgemeinschaft, Philipps-Universität Marburg

    المصدر: Theory of Computing Systems ; volume 66, issue 5, page 1019-1045 ; ISSN 1432-4350 1433-0490

    الاتاحة: http://dx.doi.org/10.1007/s00224-022-10101-z
    https://link.springer.com/content/pdf/10.1007/s00224-022-10101-z.pdf
    https://link.springer.com/article/10.1007/s00224-022-10101-z/fulltext.html

    View record in BASE

    أضف إلى المفضلة
  19. 19
    Academic Journal
    Colored Cut Games

    المؤلفون: Morawietz, Nils, Grüttemeier, Niels, Komusiewicz, Christian, Sommer, Frank

    المساهمون: Nils Morawietz and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer

    مصطلحات موضوعية: Labeled Cut, Labeled Path, Network Robustness, Kernelization, PSPACE, Polynomial Hierarchy

    وصف الملف: application/pdf

    Relation: Is Part Of LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.30

    الاتاحة: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.30
    https://nbn-resolving.org/urn:nbn:de:0030-drops-132719
    https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.30

    View record in BASE

    أضف إلى المفضلة
  20. 20
    Academic Journal
    String Factorizations Under Various Collision Constraints

    المؤلفون: Grüttemeier, Niels, Komusiewicz, Christian, Morawietz, Nils, Sommer, Frank

    المساهمون: Niels Grüttemeier and Christian Komusiewicz and Nils Morawietz and Frank Sommer

    مصطلحات موضوعية: NP-hard problem, fixed-parameter algorithms, collision-aware string partitioning

    وصف الملف: application/pdf

    Relation: Is Part Of LIPIcs, Volume 161, 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.17

    الاتاحة: https://doi.org/10.4230/LIPIcs.CPM.2020.17
    https://nbn-resolving.org/urn:nbn:de:0030-drops-121428
    https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.17

    View record in BASE

    أضف إلى المفضلة
أدوات البحث: أحصل على تغذية RSS – أرسل هذا البحث بالبريد الإلكتروني – حفظ البحث – جدول التنبيهات: لا شيء