On the public citation graph

Average parameterization and partial kernelization for computing medians

0 signed · 68 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-642-10217-2_2openalex-snapshot
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
inferredcites →https://doi.org/10.1007/978-3-642-11269-0_2openalex-snapshot
Kernelization: New Upper and Lower Bound Techniques
inferredcites →https://doi.org/10.1007/978-3-642-11269-0_26openalex-snapshot
Improved Parameterized Algorithms for the Kemeny Aggregation Problem
inferredcites →https://doi.org/10.1007/978-3-642-17493-3_5openalex-snapshot
Partial Kernelization for Rank Aggregation: Theory and Experiments
inferredcites →https://doi.org/10.1007/bf00289116openalex-snapshot
NP-hard problems in hierarchical-tree clustering
inferredcites →https://doi.org/10.1007/bf00303169openalex-snapshot
Voting schemes for which it can be difficult to tell who won the election
inferredcites →https://doi.org/10.1007/s00453-008-9211-1openalex-snapshot
Aggregation of Partial Rankings, p-Ratings and Top-m Lists
inferredcites →https://doi.org/10.1016/j.cosrev.2007.09.001openalex-snapshot
Invitation to fixed-parameter algorithms
inferredcites →https://doi.org/10.1016/j.jcss.2007.06.024openalex-snapshot
On the Approximation of Correlation Clustering and Consensus Clustering
inferredcites →https://doi.org/10.1016/j.jcss.2009.03.001openalex-snapshot
Pattern matching with address errors: Rearrangement distances
inferredcites →https://doi.org/10.1016/j.tcs.2005.08.031openalex-snapshot
The complexity of Kemeny elections
inferredcites →https://doi.org/10.1016/j.tcs.2007.05.029openalex-snapshot
Multiple genome rearrangement by swaps and by element duplications
inferredcites →https://doi.org/10.1016/j.tcs.2009.08.033openalex-snapshot
Fixed-parameter algorithms for Kemeny rankings
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1023/a:1023949509487openalex-snapshot
Consensus Clustering: A Resampling-Based Method for Class Discovery and Visualization of Gene Expression Microarray Data
inferredcites →https://doi.org/10.1093/0198240341.001.0001openalex-snapshot
Mathematics without Numbers
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1137/060673898openalex-snapshot
Closest Substring Problems with Small Distances
inferredcites →https://doi.org/10.1137/1.9781611972771.41openalex-snapshot
Are approximation algorithms for consensus clustering worthwhile?
inferredcites →https://doi.org/10.1137/1.9781611972887.11openalex-snapshot
Consensus Clustering Algorithms: Comparison and Refinement
inferredcites →https://doi.org/10.1137/1.9781611972894.4openalex-snapshot
Rank Aggregation: Together We're Strong
inferredcites →https://doi.org/10.1145/1233481.1233493openalex-snapshot
Invitation to data reduction and problem kernelization
inferredcites →https://doi.org/10.1145/1250790.1250806openalex-snapshot
How to rank with few errors
inferredcites →https://doi.org/10.1145/1411509.1411513openalex-snapshot
Aggregating inconsistent information
inferredcites →https://doi.org/10.1145/1455248.1455251openalex-snapshot
Almost-tight hardness of directed congestion minimization
inferredcites →https://doi.org/10.1145/371920.372165openalex-snapshot
Rank aggregation methods for the Web
inferredcites →https://doi.org/10.1287/moor.1090.0385openalex-snapshot
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
inferredcites →https://doi.org/10.4230/lipics.stacs.2010.2495openalex-snapshot
Reflections on Multivariate Algorithmics and Problem Parameterization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_530openalex-snapshot
Kernelization, Partially Polynomial Kernels
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_12openalex-snapshot
String Consensus Problems with Swaps and Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-319-29221-2_23openalex-snapshot
Medians of Permutations: Building Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-72751-6_3openalex-snapshot
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_25openalex-snapshot
Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_17openalex-snapshot
Diminishable Parameterized Problems and Strict Polynomial Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_5openalex-snapshot
Partial Kernelization for Rank Aggregation: Theory and Experiments
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_64openalex-snapshot
On the Parameterized Complexity of Consensus Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_530-1openalex-snapshot
Kernelization, Partially Polynomial Kernels
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_16openalex-snapshot
Studies in Computational Aspects of Voting
inferred← citeshttps://doi.org/10.1007/s00224-024-10174-yopenalex-snapshot
Cluster Editing for Multi-Layer and Temporal Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9595-1openalex-snapshot
Cluster Editing: Kernelization Based on Edge Cuts
inferred← citeshttps://doi.org/10.1007/s10458-013-9236-yopenalex-snapshot
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation
inferred← citeshttps://doi.org/10.1007/s11009-016-9506-7openalex-snapshot
Sampling and Learning Mallows and Generalized Mallows Models Under the Cayley Distance
inferred← citeshttps://doi.org/10.1016/j.artint.2015.10.003openalex-snapshot
Voting rules as error-correcting codes
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.076openalex-snapshot
Space reduction constraints for the median of permutations problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.09.041openalex-snapshot
The linear ordering problem revisited
inferred← citeshttps://doi.org/10.1016/j.future.2021.06.013openalex-snapshot
Efficient, robust and effective rank aggregation for massive biological datasets
inferred← citeshttps://doi.org/10.1016/j.ic.2016.08.003openalex-snapshot
Prices matter for the parameterized complexity of shift bribery
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.109035openalex-snapshot
A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103778openalex-snapshot
Stable marriage with multi-modal preferences
inferred← citeshttps://doi.org/10.1016/j.jda.2018.11.007openalex-snapshot
Exploring the median of permutations problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.05.002openalex-snapshot
On the parameterized complexity of consensus clustering
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.022openalex-snapshot
Automedian sets of permutations: direct sum and shuffle
inferred← citeshttps://doi.org/10.1109/tst.2014.6867518openalex-snapshot
Parameterized algorithmics for computational social choice: Nine research challenges
inferred← citeshttps://doi.org/10.1137/15m1039584openalex-snapshot
Partially Polynomial Kernels for Set Cover and Test Cover
inferred← citeshttps://doi.org/10.1145/3219166.3219168openalex-snapshot
Stable Marriage with Multi-Modal Preferences
inferred← citeshttps://doi.org/10.14778/2809974.2809982openalex-snapshot
Rank aggregation with ties: Experiments and Analysis
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8881openalex-snapshot
Prices Matter for the Parameterized Complexity of Shift Bribery
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9292openalex-snapshot
Voting Rules As Error-Correcting Codes
inferred← citeshttps://doi.org/10.3233/com-180220openalex-snapshot
Diminishable parameterized problems and strict polynomial kernelization
inferred← citeshttps://doi.org/10.3233/faia230285openalex-snapshot
Efficiently Computing Smallest Agreeable Sets
inferred← citeshttps://doi.org/10.3390/a12120256openalex-snapshot
Parameterized Algorithms in Bioinformatics: An Overview
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.67openalex-snapshot
Partially Polynomial Kernels for Set Cover and Test Cover
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2019.18openalex-snapshot
Clustering to Given Connectivities
inferred← citeshttps://doi.org/10.48550/arxiv.1709.09100openalex-snapshot
Cluster Editing for Multi-Layer and Temporal Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1801.02693openalex-snapshot
Stable Marriage with Multi-Modal Preferences
inferred← citeshttps://doi.org/10.70675/7548ce1cz66dbz4929z84ddz17f32fafcaebopenalex-snapshot
Passage à l'échelle, propriétés et qualité des algorithmes de classements consensuels pour les données biologiques massives
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.