On the public citation graph
Pareto optimal matchings of students to courses in the presence of prerequisites
0 signed · 43 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jeth.1998.2469openalex-snapshot
A Tale of Two Mechanisms: Student Placement
inferredcites →https://doi.org/10.1007/11602613_115openalex-snapshot
Pareto Optimality in House Allocation Problems
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf00183301openalex-snapshot
Queue allocation of indivisible goods
inferredcites →https://doi.org/10.1007/s001820100088openalex-snapshot
Strategy-proofness, solidarity, and consistency for multiple assignment problems
inferredcites →https://doi.org/10.1007/s00224-016-9677-1openalex-snapshot
Pareto Optimal Matchings in Many-to-Many Markets with Ties
inferredcites →https://doi.org/10.1007/s12599-014-0316-6openalex-snapshot
Course Allocation via Stable Matching
inferredcites →https://doi.org/10.1016/0022-0531(85)90106-1openalex-snapshot
The college admissions problem is not equivalent to the marriage problem
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/j.dam.2011.11.003openalex-snapshot
Matching with sizes (or scheduling with processing set restrictions)
inferredcites →https://doi.org/10.1016/j.disopt.2014.09.002openalex-snapshot
Pareto optimality in many-to-many matching problems
inferredcites →https://doi.org/10.1016/j.geb.2007.01.003openalex-snapshot
Serial dictatorship and Pareto optimality
inferredcites →https://doi.org/10.1016/j.jmateco.2013.12.002openalex-snapshot
A note on object allocation under lexicographic preferences
inferredcites →https://doi.org/10.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1111/1097-3923.00066openalex-snapshot
Strategyproof and Nonbossy Multiple Assignments
inferredcites →https://doi.org/10.1145/2513564openalex-snapshot
An English-Language Argumentation Interface for Explanation Generation with Markov Decision Processes in the Domain of Academic Advising
inferredcites →https://doi.org/10.1257/aer.102.5.2237openalex-snapshot
The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard
inferredcites →https://doi.org/10.1287/opre.26.1.22openalex-snapshot
Complexity of Scheduling under Precedence Constraints
inferredcites →https://doi.org/10.1609/aaai.v28i1.8817openalex-snapshot
Strategyproof Exchange with Multiple Private Endowments
inferredcites →https://doi.org/10.2307/1913392openalex-snapshot
Job Matching, Coalition Formation, and Gross Substitutes
inferredcites →https://doi.org/10.2307/2998580openalex-snapshot
Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2015.543openalex-snapshot
Allocation of Divisible Goods Under Lexicographic Preferences
inferredcites →https://doi.org/10.48550/arxiv.1412.2226openalex-snapshot
Possible and Necessary Allocations via Sequential Mechanisms
inferredcites →https://doi.org/10.48550/arxiv.1507.07064openalex-snapshot
Strategyproof Quota Mechanisms for Multiple Assignment Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4719264openalex-extracted
The Division Problem of Chances
inferred← citeshttps://doi.org/10.2139/ssrn.4755425openalex-extracted
The Division Problem of Chances
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_4openalex-snapshot
Student Course Allocation with Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-03639-1_16openalex-snapshot
Course Allocation with Credits via Stable Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-67504-6_21openalex-snapshot
Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists
inferred← citeshttps://doi.org/10.1007/s10458-020-09448-9openalex-snapshot
Strategyproof and fair matching mechanism for ratio constraints
inferred← citeshttps://doi.org/10.1007/s12597-025-01053-2openalex-snapshot
Approaches to assigning courses to students: a systematic review of existing literature and emerging topics
inferred← citeshttps://doi.org/10.1016/j.seps.2020.100974openalex-snapshot
Mathematical programming for nominating exchange students for international universities: The impact of stakeholders’ objectives and fairness constraints on allocations
inferred← citeshttps://doi.org/10.1371/journal.pone.0289965openalex-snapshot
Strategyproof and fair matching mechanism for union of symmetric m-convex constraints
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5608openalex-snapshot
Algorithms for Manipulating Sequential Allocation
inferred← citeshttps://doi.org/10.2139/ssrn.4848895openalex-snapshot
Compromising Between Random Priority and Probabilistic Serial Mechanism
inferred← citeshttps://doi.org/10.22541/au.167226827.72669249/v1openalex-snapshot
Strategyproof and Fair Matching Mechanism for Union of Symmetric M-convex Constraints
inferred← citeshttps://doi.org/10.33542/ppf-0186-5openalex-snapshot
Profesori Prírodovedeckej fakulty UPJŠ v Košiciach 1963 – 2023
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.