| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié |
The max quasi-independent set problem.  |
J. Comb. Optim.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Boria, Cécile Murat, Vangelis Th. Paschos |
On the probabilistic min spanning tree Problem. |
J. Math. Model. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
Fast Algorithms for max independent set. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire |
Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos |
Online Maximum k-Coverage. |
FCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
A survey on the structure of approximation classes. |
Computer Science Review |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
On the max-weight edge coloring problem. |
J. Comb. Optim. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
Approximating the max-edge-coloring problem. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos |
Probabilistic models for the Steiner Tree problem. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cécile Murat, Vangelis Th. Paschos |
Probabilistic optimization in graph-problems. |
Algorithmic Operations Research |
2010 |
DBLP BibTeX RDF |
|
| 1 | Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo |
Approximating the metric 2-Peripatetic Salesman Problem. |
Algorithmic Operations Research |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nicolas Boria, Vangelis Th. Paschos |
Fast reoptimization for the minimum spanning tree problem. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié |
The max quasi-independent set Problem. |
CSR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Boria, Cécile Murat, Vangelis Th. Paschos |
On the Probabilistic min spanning tree problem. |
IMCSIT |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
A Bottom-Up Method and Fast Algorithms for max independent set. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Fast Algorithms for min independent dominating set. |
SIROCCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos |
Probabilistic graph-coloring in bipartite and split graphs. |
J. Comb. Optim. |
2009 |
DBLP DOI BibTeX RDF |
Probabilistic optimization, Approximation algorithms, Graph coloring |
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Approximation of min coloring by moderately exponential algorithms. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Efficient approximation of min set cover by moderately exponential algorithms. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos |
Greedy Algorithms For On-Line Set-Covering. |
Algorithmic Operations Research |
2009 |
DBLP BibTeX RDF |
|
| 1 | Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos |
Simple and Fast Reoptimizations for the Steiner Tree Problem. |
Algorithmic Operations Research |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Fast algorithms for min independent dominating set |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
Max Edge Coloring of Trees |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos |
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of minimum and maximum traveling salesman's tours. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos |
Exact Algorithms for Dominating Clique Problems. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
Approximating the Max Edge-Coloring Problem. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Federico Della Croce, Vangelis Th. Paschos |
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems. |
Operational Research |
2008 |
DBLP DOI BibTeX RDF |
Dominance conditions, Set covering, Max cut, Worst-case complexity |
| 1 | Vangelis Th. Paschos |
Combinatorial Optimization and Theoretical Computer Science - Interfaces and Perspectives: 30th Anniversary of the LAMSADE. |
|
2008 |
RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Cécile Murat, Vangelis Th. Paschos |
Vertex-Uncertainty in Graph-Problems. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
On the Maximum Edge Coloring Problem. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos |
Improved worst-case complexity for the MIN 3-SET COVERING problem. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Federico Della Croce, Marcin Jakub Kaminski, Vangelis Th. Paschos |
An exact algorithm for MAX-CUT in sparse graphs. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
Differential approximation of min sat. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Time slot scheduling of compatible jobs. |
J. Scheduling |
2007 |
DBLP DOI BibTeX RDF |
Weighted coloring, Chromatic scheduling, Approximations, Edge coloring, Batch scheduling |
| 1 | Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos |
On the Performance of Congestion Games for Optimum Satisfiability Problems. |
WINE |
2007 |
DBLP DOI BibTeX RDF |
non oblivious local search, max sat, approximation algorithm, price of anarchy |
| 1 | Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos |
Steiner Forests on Stochastic Metric Graphs. |
COCOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yury Glazkov, Alexey Baburin, Edward Gimadi, Federico Della Croce, Vangelis Th. Paschos |
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: further complexity and approximability results. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
Completeness in approximation classes beyond APX. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vangelis Th. Paschos |
Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Vangelis Th. Paschos |
Reductions, completeness and the hardness of approximability. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
On-line models and algorithms for max independent set. |
RAIRO - Operations Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Cécile Murat, Vangelis Th. Paschos |
On the probabilistic minimum coloring and minimum k-coloring. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos |
Greedy algorithms for on-line set-covering and related problems. |
CATS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of Minimum and Maximum Traveling Salesman's Tours. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière |
On the differential approximation of MIN SET COVER. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
On-line vertex-covering. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
Completeness in differential approximation classes. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Polynomial approximation algorithms with performance guarantees: An introduction-by-example. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Improved Approximations for Weighted and Unweighted Graph Problems. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
A hypocoloring model for batch scheduling. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
Proving completeness by logic. |
Int. J. Comput. Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: Further Complexity and Approximability Results. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree |
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
Differential Approximation of min sat, max sat and Related Problems. |
ICCSA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos |
Probabilistic Coloring of Bipartite and Split Graphs. |
ICCSA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière |
Greedy Differential Approximations for Min Set Cover. |
SOFSEM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Federico Della Croce, Vangelis Th. Paschos |
Computing Optimal Solutions for the min 3-set covering Problem. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
Local approximations for maximum partial subgraph problem. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos |
Algorithms for the On-Line Quota Traveling Salesman Problem. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos |
A simulated annealing approach for the circular cutting problem. |
European Journal of Operational Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos |
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. |
J. Scheduling |
2004 |
DBLP DOI BibTeX RDF |
total tardiness, scheduling, approximation |
| 1 | Tinaz Ekim, Vangelis Th. Paschos |
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation. |
Int. J. Comput. Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos |
Algorithms for the On-Line Quota Traveling Salesman Problem. |
COCOON |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vangelis Th. Paschos |
Polynomial Approximation and Graph-Coloring. |
Computing |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification: 05C15, 68Q17, 68Q25, 90C59, 68W25 |
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
Differential approximation results for the traveling salesman problem with distances 1 and 2. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Vangelis Th. Paschos |
Differential approximation for optimal satisfiability and related problems. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
Differential approximation results for the Steiner tree problem. |
Appl. Math. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
Optima locaux garantis pour l'approximation différentielle. |
Technique et Science Informatiques |
2003 |
DBLP BibTeX RDF |
|
| 1 | Cécile Murat, Vangelis Th. Paschos |
The Probabilistic Minimum Coloring Problem. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
Completeness in Differential Approximation Classes. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cécile Murat, Vangelis Th. Paschos |
A priori optimization for the probabilistic maximum independent set problem. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances. |
RAIRO - Operations Research |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation. |
RAIRO - Operations Research |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Node Coloring: When Stable Sets Are Expensive. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Algorithms and Models for the On-Line Vertex-Covering. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vangelis Th. Paschos |
On-line independent set by coloring vertices. |
Operational Research |
2001 |
DBLP DOI BibTeX RDF |
On-line computation, Approximation algorithm, Coloring, Independent set |
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. |
FCT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Xavier Paradon, Vangelis Th. Paschos |
On-Line Maximum-Order Induces Hereditary Subgraph Problems. |
SOFSEM |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs |
An improved general procedure for lexicographic bottleneck problems. |
Oper. Res. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Cécile Murat, Vangelis Th. Paschos |
The probabilistic longest path problem. |
Networks |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Pascal Grisoni, Vangelis Th. Paschos |
Differential Approximation Algorithms for Some Combinatorial Optimization Problems. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Andreas Stafylopatis |
Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases. |
Acta Inf. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vangelis Th. Paschos |
A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems. |
ACM Comput. Surv. |
1997 |
DBLP DOI BibTeX RDF |
approximation algorithms, constrained optimization, combinatorial algorithms, algorithm analysis, problem complexity |
| 1 | Marc Demange, Vangelis Th. Paschos |
On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad |
Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Vangelis Th. Paschos |
Constructive - Non-constructive Approximation and Maximum Independent Set Problem. |
Combinatorics and Computer Science |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Pascal Grisoni, Vangelis Th. Paschos |
Approximation Results for the Minimum Graph Coloring Problem. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")