The following pages link to OpenAlex ID (P388):
Displaying 50 items.
- Inference theory for volatility functional dependencies (Q284294) (← links)
- Double asymptotics for explosive continuous time models (Q284296) (← links)
- Statistical inference in a random coefficient panel model (Q284298) (← links)
- Multivariate and multiple permutation tests (Q284300) (← links)
- Smoothed quantile regression for panel data (Q284303) (← links)
- A discontinuity test for identification in triangular nonseparable models (Q284307) (← links)
- Fixed-smoothing asymptotics in the generalized empirical likelihood estimation framework (Q284309) (← links)
- \(S\)-values: conventional context-minimal measures of the sturdiness of regression coefficients (Q284311) (← links)
- Informational content of special regressors in heteroskedastic binary response models (Q284314) (← links)
- Testing for monotonicity in unobservables under unconfoundedness (Q284318) (← links)
- A bias-corrected estimator of the covariation matrix of multiple security prices when both microstructure effects and sampling durations are persistent and endogenous (Q284320) (← links)
- Bayesian treatment effects models with variable selection for panel outcomes with an application to earnings effects of maternity leave (Q284325) (← links)
- The cross-quantilogram: measuring quantile dependence and testing directional predictability between time series (Q284329) (← links)
- Model averaging in semiparametric estimation of treatment effects (Q284331) (← links)
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
- Computing Roman domatic number of graphs (Q284340) (← links)
- Improved balanced flow computation using parametric flow (Q284342) (← links)
- Topological orderings of weighted directed acyclic graphs (Q284347) (← links)
- Finding a chain graph in a bipartite permutation graph (Q284350) (← links)
- The \(g\)-good-neighbor conditional diagnosability of \(n\)-dimensional hypercubes under the MM* model (Q284352) (← links)
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- Hamiltonian decomposition of generalized recursive circulant graphs (Q284357) (← links)
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- Representative democracy and the implementation of majority-preferred alternatives (Q284362) (← links)
- On avoiding vote swapping (Q284364) (← links)
- Convex strategyproofness with an application to the probabilistic serial mechanism (Q284366) (← links)
- Empirical welfare analysis: when preferences matter (Q284369) (← links)
- Community dynamics in the lab (Q284371) (← links)
- Consistent updating of social welfare functions (Q284373) (← links)
- The difference between manipulability indices in the IC and IANC models (Q284375) (← links)
- Axioms for centrality scoring with principal eigenvectors (Q284377) (← links)
- Fair social orderings with other-regarding preferences (Q284380) (← links)
- A characterization of the \(n\)-agent Pareto dominance relation (Q284382) (← links)
- Using a lag-balance property to tighten tardiness bounds for global EDF (Q284384) (← links)
- The practice and theory of automated timetabling (2012) (Q284385) (← links)
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- Workforce scheduling and routing problems: literature survey and computational study (Q284388) (← links)
- The third international timetabling competition (Q284392) (← links)
- GOAL solver: a hybrid local search based solver for high school timetabling (Q284398) (← links)
- Elective course student sectioning at Danish high schools (Q284401) (← links)
- Repairing high school timetables with polymorphic ejection chains (Q284402) (← links)
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling (Q284406) (← links)
- Real-life curriculum-based timetabling with elective courses and course sections (Q284409) (← links)
- Fairness in academic course timetabling (Q284412) (← links)
- A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering (Q284416) (← links)
- An assessment of a days off decomposition approach to personnel shift scheduling (Q284419) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- A study of decision support models for online patient-to-room assignment planning (Q284425) (← links)
- Near-optimal MIP solutions for preference based self-scheduling (Q284428) (← links)
