Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

نتائج البحث

Display Settings
النتائج لكل صفحة: 10
Sort By: Relevance
Filter
  • 1-10 ل  912 نتائج ل ""G.2.2""

فلترة النتائج

Subject : data structures and algorithms (cs.ds)
إعادة تعيين خيارات الفبترة
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Academic Journal

Compound Logics for Modification Problems

Subjects: Flat Wall theorem; FOS: Computer and information sciences; Computer Science - Logic in Computer Science

  • Source: Leibniz International Proceedings in Informatics61:1-61:21

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
Academic Journal

Polyhedral approach to weighted connected matchings in general graphs

Subjects: G.4; FOS: Computer and information sciences; Discrete Mathematics (cs.DM)

  • Source: Discrete Applied Mathematics

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
Academic Journal

A constant-factor approximation for weighted bond cover

Subjects: FOS: Computer and information sciences; F.2.2; G.2.2

  • Source: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)Approximation, Randomization, and Combinatorial Optimization. Algorithms and

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
Book

Finding irrelevant vertices in linear time on bounded-genus graphs

Subjects: FOS: Computer and information sciences; F.2.2; G.2.2

  • Source: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611978322

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
Book

Simple Combinatorial Construction of the ko (1)-Lower Bound for Approximating the Parameterized k-Clique

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); G.2.1

  • Source: 2025 Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611978315

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
Book

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes

Subjects: FOS: Computer and information sciences; Computer Science - Logic in Computer Science; Computer Science - Data Structures and Algorithms

  • Source: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611978322

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
Book

Fast and Simple Sorting Using Partial Information

Subjects: FOS: Computer and information sciences; F.2.2; G.2.2

  • Source: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611978322

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
Academic Journal

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps

Subjects: FOS: Computer and information sciences; F.2.2; G.2.2

  • Source: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). :2099-2130

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
Academic Journal

Efficient Approximation of Fractional Hypertree Width

Subjects: FOS: Computer and information sciences; Computer Science - Databases; Discrete Mathematics (cs.DM)

  • Source: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). :754-779

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
Academic Journal

Fractional Budget Allocation for Influence Maximization under General Marketing Strategies

Subjects: Social and Information Networks (cs.SI); FOS: Computer and information sciences; J.4

  • Source: Proceedings of the 33rd ACM International Conference on Information and Knowledge Management. :3627-3631

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
  • 1-10 ل  912 نتائج ل ""G.2.2""