Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6711898
@@ Property / title @@
+Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68123
@@ Property / zbMATH Open document ID: 1430.68123 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-53925-6_26
@@ Property / DOI: 10.1007/978-3-319-53925-6_26 / rank @@
+Normal rank
@@ Property / published in @@
+WALCOM: Algorithms and Computation
@@ Property / published in: WALCOM: Algorithms and Computation / rank @@
+Normal rank
@@ Property / publication date @@
+May 2017Timestamp +2017-05-05T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2017-05-05T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 5 May 2017 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6711898
@@ Property / zbMATH DE Number: 6711898 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2584192475
@@ Property / OpenAlex ID: W2584192475 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288579
@@ Property / cites work: Q4288579 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
+Normal rank
@@ Property / cites work @@
+Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
+Normal rank
@@ Property / cites work @@
+Chordal editing is fixed-parameter tractable
@@ Property / cites work: Chordal editing is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
+Normal rank
@@ Property / cites work @@
+On the threshold of intractability
@@ Property / cites work: On the threshold of intractability / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum Chain Completion problem
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Algorithms for automatic ranking of participants and tasks in an anonymized contest
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Authoritative sources in a hyperlinked environment
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
+Normal rank
@@ Property / cites work @@
+Inapproximability of Treewidth and Related Problems
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q3151174
@@ Property / cites work: Q3151174 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743514
@@ Property / cites work: Q5743514 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129440085
@@ Property / Wikidata QID: Q129440085 / rank @@
+Normal rank

Latest revision as of 01:34, 27 August 2024

scientific article; zbMATH DE number 6711898

Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest

Language	Label	Description	Also known as
English	Algorithms for automatic ranking of participants and tasks in an anonymized contest	scientific article; zbMATH DE number 6711898	Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest